A structural lemma for deterministic context-free languages

DOI10.1007/978-3-319-98654-8_45zbMATH Open1506.68049OpenAlexW2887672569MaRDI QIDQ1623005FDOQ1623005

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

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

Mathematics Subject Classification ID

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

Cited In (8)

• A pumping lemma for regular closure of prefix-free languages
• Title not available (Why is that?)
• A generalization of the flip-flop lemma
• A pumping lemma for deterministic context-free languages
• Kolmogorov Complexity and 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 pumping lemma for real-time 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)