Safety of recursive Horn clauses with infinite relations
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the valuedness of finite transducers
Acta Informatica
Pattern matching by Rs-operations: towards a unified approach to querying sequenced data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the lengths of values in a finite transducer
Acta Informatica
Reasoning about strings in databases
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
Sequences, Datalog and transducers
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A framework for testing safety and effective computability
Journal of Computer and System Sciences
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Absolutely parallel grammars and two-way finite-state transducers
Journal of Computer and System Sciences
| Hi-index | 0.00 |
We wish to use a given nondeterministic two-way multitape acceptor as a transducer by supplying the contents for only some of its input tapes, and asking it to generate the missing contents for the other tapes. We provide here an algorithm for determining beforehand whether this transduction always results in a finite set of answers or not. We also develop an algorithm for evaluating these finite answers whenever the previous algorithm indicated their existence. Our algorithms can also be used for speeding up the simulation of these acceptors even when not used as transducers.