Kolmogorov Complexity and Deterministic Context-Free Languages
From MaRDI portal
Publication:4429692
Recommendations
- Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata
- A structural lemma for deterministic context-free languages
- A New Approach to Formal Language Theory by Kolmogorov Complexity
- scientific article; zbMATH DE number 4117885
- A pumping lemma for deterministic context-free languages
Cited in
(10)- A pumping lemma for regular closure of prefix-free languages
- A structural lemma for deterministic context-free languages
- Refined Bounds on Kolmogorov Complexity for ω-Languages
- Kolmogorov complexity descriptions of the exquisite behaviors of advised deterministic pushdown automata
- scientific article; zbMATH DE number 4117885 (Why is no real title available?)
- A New Approach to Formal Language Theory by Kolmogorov Complexity
- scientific article; zbMATH DE number 4187790 (Why is no real title available?)
- Cover complexity of finite languages
- scientific article; zbMATH DE number 1361492 (Why is no real title available?)
- On the context-free production complexity of finite languages
This page was built for publication: Kolmogorov Complexity and Deterministic Context-Free Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4429692)