Sets recognized by n-tape automata

DOI10.1016/0021-8693(69)90107-0zbMath0207.02002OpenAlexW1979257155MaRDI QIDQ2542993

Calvin C. Elgot, John C. Shepherdson

Publication date: 1969

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(69)90107-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (14)

The decision problem for some logics for finite words on infinite alphabets ⋮ Multi-dimensional sets recognizable in all abstract numeration systems ⋮ Automata Presenting Structures: A Survey of the Finite String Case ⋮ Quasi-automatic semigroups ⋮ In memoriam Calvin C. Elgot ⋮ Learning two-tape automata from queries and counterexamples ⋮ AN APPLICATION OF FIRST-ORDER LOGIC TO THE STUDY OF RECOGNIZABLE LANGUAGES ⋮ The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata ⋮ Rational relations having a rational trace on each finite intersection of rational relations ⋮ Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. ⋮ Graph Logics with Rational Relations ⋮ The Quantifier Alternation Hierarchy of Synchronous Relations ⋮ Calvin C. Elgot (1922-1980) ⋮ Decision problems among the main subfamilies of rational relations

Cites Work

• Quantifier elimination in a problem of logical design
• On Relations Defined by Generalized Finite Automata
• Unnamed Item

This page was built for publication: Sets recognized by n-tape automata