Context-free languages and primitive words

DOI10.1142/7265zbMATH Open1476.68003OpenAlexW590170814MaRDI QIDQ4898710FDOQ4898710

Authors: Pál Dömösi, Masami Ito 

Publication date: 2 January 2013

Full work available at URL: https://doi.org/10.1142/7265

Recommendations

• Context-free languages consisting of non-primitive words
• scientific article; zbMATH DE number 1134658
• scientific article; zbMATH DE number 1091111
• scientific article; zbMATH DE number 1528638
• scientific article; zbMATH DE number 522846

zbMATH Keywords

rootscontext-free languagesdecidabilitypalindromic languagesprimitive wordsrewriting systemspalindromesbounded languagesmultisetsMarcus contextual grammarsiteration lemmataKászonyi-Katsura theorynon-primitive words

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Combinatorics on words (68R15)

Cited In (14)

• Avoidance of split overlaps
• On primitive words with non-primitive product
• Title not available (Why is that?)
• On the unavoidability of primitive words and other languages
• Title not available (Why is that?)
• Context-Free Languages of Countable Words
• String rearrangement inequalities and a total order between primitive words
• Non-primitive words of the formpq^m
• Some periodicity of words and Marcus contextual grammars
• Markers and deterministic acceptors for non-deterministic languages
• On block pumpable languages
• Some results on small context-free grammars generating primitive words
• Title not available (Why is that?)
• Context-free languages consisting of non-primitive words

This page was built for publication: Context-free languages and primitive words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4898710)