Rational equivalence relations
Theoretical Computer Science
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Decidability of the multiplicity equivalence of multitape finite automata
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
The equivalence problem of multitape finite automata
Theoretical Computer Science
Infinite trees and automaton-definable relations over &ohgr;-words
Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Quantifier Hierarchies over Word Relations
CSL '91 Proceedings of the 5th Workshop on Computer Science Logic
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Finite n-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.
Theoretical Computer Science
Finite automata and their decision problems
IBM Journal of Research and Development
On relations defined by generalized finite automata
IBM Journal of Research and Development
Multitape one-way nonwriting automata
Journal of Computer and System Sciences
| Hi-index | 5.23 |
We consider the first-order theory of the free infinitely generated monoid with the usual predicates ''prefix'' and ''equal length'' along with the predicate ''equal last letter''. The associated definable relations are related to the algebras of relations recognized by different types of multitape automata which are natural extensions of the famous Rabin-Scott multitape automata and the synchronous automata. We investigate these classes of automata and solve decision issues concerning them.