scientific article; zbMATH DE number 2040920

zbMATH Open1037.68085MaRDI QIDQ4452076FDOQ4452076

Markus Holzer, Martin Kutrib

Publication date: 11 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2710/27100361.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2038733
• Two Grammatical Equivalents of Flip-Pushdown Automata
• A pumping lemma for flip-pushdown languages
• Context-dependent nondeterminism for pushdown automata
• Context-Dependent Nondeterminism for Pushdown Automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (9)

• Flip-pushdown automata with \(k\) pushdown reversals and E0L systems are incomparable
• A pumping lemma for flip-pushdown languages
• Deterministic Input-Reversal and Input-Revolving Finite Automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• On store languages of language acceptors
• Deterministic input-driven queue automata: finite turns, decidability, and closure properties
• On store languages and applications
• Queue Automata: Foundations and Developments

This page was built for publication:

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