Iterated GSMs and CO-CFL
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3932412 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- Adherences of languages
- An infinite square-free co-CFL
- An infinite word language which is not co-CFL
- Applications of an infinite square-free co-CFL
- Every iterated morphism yields a co-CFL
- Prefixes of infinite words and ambiguous context-free languages
- Production en temps réel et complexité de structure de suites infinies
- Substitution and bounded languages
- Sur les centres de DOL-langages
- The Turing degree of the inherent ambiguity problem for context-free languages
Cited in
(10)- scientific article; zbMATH DE number 2155202 (Why is no real title available?)
- Comparing descriptional and computational complexity of infinite words
- Properties of infinite words: recent results
- A Hierarchy of Automaticω-Words having a Decidable MSO Theory
- Iterative devices generating infinite words
- Iterated sequential transducers as language generating devices
- On quasi orders of words and the confluence property
- scientific article; zbMATH DE number 1408344 (Why is no real title available?)
- Every iterated morphism yields a co-CFL
- Languages obtained from infinite words
This page was built for publication: Iterated GSMs and CO-CFL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1112624)
