scientific article; zbMATH DE number 1759446

zbMATH Open0996.68102MaRDI QIDQ4536396FDOQ4536396

Authors: Giovanni Pighizzini 

Publication date: 4 November 2002

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

Recommendations

• Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
• Unary pushdown automata and straight-line programs
• Unambiguous auxiliary pushdown automata and semi-unbounded fan-in circuits
• Deterministic Pushdown Automata and Unary Languages
• DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
• Unboundedness and downward closures of higher-order pushdown automata
• Descriptional complexity of unambiguous input-driven pushdown automata
• Alternation bounded auxiliary pushdown automata
• Pushdown automata with bounded nondeterminism and bounded ambiguity
• Pushdown automata with bounded nondeterminism and bounded ambiguity

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (5)

• DETERMINISTIC PUSHDOWN AUTOMATA AND UNARY LANGUAGES
• Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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 Q4536396)