Applications of an infinite square-free co-CFL
From MaRDI portal
Publication:1088415
DOI10.1016/0304-3975(87)90003-XzbMath0612.68070MaRDI QIDQ1088415
W. Bucher, David Haussler, Michael G. Main
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
squarecontext-free languagecuberepetitionscomplementsyntactic monoidspumping lemmaslocally linear languages
Related Items (7)
An infinite word language which is not co-CFL ⋮ An efficient algorithm for online square detection ⋮ Iterated GSMs and CO-CFL ⋮ Properties of infinite words : Recent results ⋮ On block pumpable languages ⋮ Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns ⋮ Every iterated morphism yields a co-CFL
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An infinite square-free co-CFL
- Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids
- Every iterated morphism yields a co-CFL
- Rational languages and the Burnside problem
- On total regulators generated by derivation relations
- Avoidable patterns in strings of symbols
- Mots sans carre et morphismes iterés
- Permutations are not context-free: An application of the interchange lemma
- Pumping Lemmas for Regular Sets
- Locally linear families of languages
- A note on 1-locally linear languages
This page was built for publication: Applications of an infinite square-free co-CFL
