Pushdown automata free of explicit nondeterminism and an infinite hierarchy of context-free languages

zbMATH Open1148.68029MaRDI QIDQ5445178FDOQ5445178

Authors: Benjamín Bedregal 

Publication date: 3 March 2008

Recommendations

• Nondeterminism degrees for context-free languages
• Measures of nondeterminism for pushdown automata
• Pumping and pushdown machines
• Pushdown automata with bounded nondeterminism and bounded ambiguity
• Pushdown automata with bounded nondeterminism and bounded ambiguity

zbMATH Keywords

hierarchypushdown automata\(\lambda\)-movesamount of nondeterminismimplicit and explicit nondeterminism

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (10)

• PUSHDOWN AUTOMATA ON INFINITE TREES AND NONDETERMINISTIC CONTEXT-FREE PROGRAMS
• Title not available (Why is that?)
• Pushdown automata with bounded nondeterminism and bounded ambiguity
• Measuring nondeterminism in pushdown automata
• Measures of nondeterminism for pushdown automata
• A note on limited pushdown alphabets in stateless deterministic pushdown automata
• Nondeterminism degrees for context-free languages
• Title not available (Why is that?)
• Oracle pushdown automata, nondeterministic reducibilities, and the hierarchy over the family of context-free languages
• On closure properties of \(\mathcal{L}\)-valued linear languages

This page was built for publication: Pushdown automata free of explicit nondeterminism and an infinite hierarchy of context-free languages

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