A structural lemma for deterministic context-free languages

DOI10.1007/978-3-319-98654-8_45MaRDI QIDQ1623005zbMATH OpenOpenAlexFDO

Authors Alexander A. Rubtsov

Publication date 22 November 2018

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• A pumping lemma for deterministic context-free languages
• Kolmogorov Complexity and Deterministic Context-Free Languages
• A pumping lemma for real-time deterministic context-free languages
• Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
• Pumping and pushdown machines

Cited in

(8)

• scientific article; zbMATH DE number 1870548 (Why is no real title available?)
• A pumping lemma for real-time deterministic context-free languages
• Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata
• Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
• A generalization of the flip-flop lemma
• A pumping lemma for deterministic context-free languages
• A pumping lemma for regular closure of prefix-free languages
• Kolmogorov Complexity and Deterministic Context-Free Languages

This page was built for publication: A structural lemma for deterministic context-free languages

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