Formalizing decidability theorems about automata

MaRDI QIDQ4263836zbMATH OpenFDO

Authors Robert Constable

Publication date 22 September 1999

zbMATH Keywords

decidabilityfinite automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Formalizing the Logic-Automaton Connection
• Decidability, introduction rules and automata
• Formal proof -- theory and practice
• A formalisation of the Myhill-Nerode theorem based on regular expressions
• Autarkic computations in formal proofs

Cited in

(8)

• Automata for a decidable subset of duration calculus.
• Formalizing Turing Machines
• Formalizing the Logic-Automaton Connection
• Decidability, introduction rules and automata
• Automatic Decidability and Combinability Revisited
• Mechanisation of PDA and grammar equivalence for context-free languages
• scientific article; zbMATH DE number 3385562 (Why is no real title available?)
• A criterion for the decidability of the A-completeness problem for definite automata

This page was built for publication: Formalizing decidability theorems about automata

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