Squares of regular languages

DOI10.1002/MALQ.200410032MaRDI QIDQ4680378zbMATHOpenAlexFDO

Authors Gerhard Lischke

Publication date 1 June 2005

Published in MLQ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200410032

zbMATH Keywords

context-free languagesdecidabilityprimitive wordsregular languagesset of squares

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Combinatorics on words (68R15)

Recommendations

• Publication:4502528
• Context-free languages consisting of non-primitive words
• scientific article; zbMATH DE number 1948500
• scientific article; zbMATH DE number 2087230
• Roots and powers in regular languages: recognizing nonregular properties by finite automata
• On the square of regular languages
• Corrigendum to “Generalized periodicity and primitivity for words”
• A graph-based regularity test for deterministic context-free languages
• Some definitions of the class of CF languages
• Context-freeness of the power of context-free languages is undecidable

Cited in

(9)

• scientific article; zbMATH DE number 3972211 (Why is no real title available?)
• Roots and powers in regular languages: recognizing nonregular properties by finite automata
• Square on deterministic, alternating, and Boolean finite automata
• Powers of Regular Languages
• Square on Deterministic, Alternating, and Boolean Finite Automata
• scientific article; zbMATH DE number 1948500 (Why is no real title available?)
• scientific article; zbMATH DE number 1504577 (Why is no real title available?)
• Deleting powers in words
• Most pseudo-copy languages are not context-free

This page was built for publication: Squares of regular languages

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