A structural lemma for deterministic context-free languages
From MaRDI portal
Publication:1623005
DOI10.1007/978-3-319-98654-8_45zbMath1506.68049OpenAlexW2887672569MaRDI QIDQ1623005
Publication date: 22 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-98654-8_45
Formal languages and automata (68Q45) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Related Items (2)
Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata ⋮ A pumping lemma for regular closure of prefix-free languages
This page was built for publication: A structural lemma for deterministic context-free languages
