Generalizations of checking stack automata: characterizations and hierarchies

DOI10.1007/978-3-319-98654-8_34MaRDI QIDQ1622991zbMATH OpenOpenAlexFDO

Authors Oscar H. Ibarra, Ian McQuillan

Publication date 22 November 2018

Full work available at URL https://doi.org/10.1007/978-3-319-98654-8_34

zbMATH Keywords

characterizationshierarchiesmulti-head finite automatachecking stack automataspace-bounded Turing machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Generalizations of Checking Stack Automata: Characterizations and Hierarchies
• The power of two-way deterministic checking stack automata
• Recursion schemes, collapsible pushdown automata and higher-order model checking
• Streett Automata Model Checking of Higher-Order Recursion Schemes
• Automata-Theoretic Model Checking Revisited
• scientific article; zbMATH DE number 2163034
• A generic framework for checking semantic equivalences between pushdown automata and finite-state automata

Cited in

(5)

• Space Complexity of Stack Automata Models
• The power of two-way deterministic checking stack automata
• The design of checkable automata. II
• Generalizations of Checking Stack Automata: Characterizations and Hierarchies
• Space complexity of stack automata models

This page was built for publication: Generalizations of checking stack automata: characterizations and hierarchies

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