On non-primitive palindromic context-free languages

DOI10.1142/S0129054112400527MaRDI QIDQ4923280zbMATH OpenFDO

Authors Szilárd Zsolt Fazekas, Peter Leupold, Kayoko Shikishima-Tsuji

Publication date 6 June 2013

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

palindromeprimitive wordcontext-freeunavoidable

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15)

Recommendations

• Palindromes and primitivity
• Some results on primitive words, palindromes and polyslender languages
• Primitive words are unavoidable for context-free languages
• scientific article; zbMATH DE number 2051172
• On the unavoidability of primitive words and other languages

Cites work

• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Context-free languages consisting of non-primitive words
• Marcus contextual languages consisting of primitive words
• On the language of primitive words

Cited in

(5)

• scientific article; zbMATH DE number 2051172 (Why is no real title available?)
• Primitive words are unavoidable for context-free languages
• Palindromes and primitivity
• Some results on primitive words, palindromes and polyslender languages
• On Chomsky hierarchy of palindromic languages

This page was built for publication: On non-primitive palindromic context-free languages

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