Description of restricted automata by first-order formulae

DOI10.1007/BF01698129zbMATH Open0317.02038OpenAlexW2052273902MaRDI QIDQ4077997FDOQ4077997

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

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

Cites Work

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

Cited In (2)

• Cayley automata
• Complexity results for classes of quantificational formulas

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)