Description of restricted automata by first-order formulae

DOI10.1007/BF01698129MaRDI QIDQ4077997zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• Classification of AEA formulas by letter atoms
• Decidability of Second-Order Theories and Automata on Infinite Trees
• scientific article; zbMATH DE number 3715502 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• On Computable Numbers, with an Application to the Entscheidungsproblem
• One-way stack automata
• Program schemata and the first-order decision problem
• Properties of Programs and the First-Order Predicate Calculus
• Tree acceptors and some of their applications

Cited in

(2)

• Complexity results for classes of quantificational formulas
• Cayley automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4077997)