Description of restricted automata by first-order formulae

DOI10.1007/BF01698129zbMath0317.02038OpenAlexW2052273902MaRDI QIDQ4077997

Harry R. Lewis

Publication date: 1975

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01698129

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (2)

Complexity results for classes of quantificational formulas ⋮ Cayley automata

Cites Work

• Program schemata and the first-order decision problem
• Tree acceptors and some of their applications
• Classification of $AEA$ formulas by letter atoms
• One-way stack automata
• Properties of Programs and the First-Order Predicate Calculus
• Decidability of Second-Order Theories and Automata on Infinite Trees
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item

This page was built for publication: Description of restricted automata by first-order formulae