Squares of regular languages

DOI10.1002/MALQ.200410032zbMATH Open1062.68073OpenAlexW2104948090MaRDI QIDQ4680378FDOQ4680378

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• Square on Deterministic, Alternating, and Boolean Finite Automata
• Square on deterministic, alternating, and Boolean finite automata
• Title not available (Why is that?)
• Title not available (Why is that?)
• Powers of Regular Languages
• 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)