Simple equations on binary factorial languages

DOI10.1016/J.TCS.2009.03.001zbMath1176.68104OpenAlexW2111707461MaRDI QIDQ2271433

Anna E. Frid

Publication date: 7 August 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.03.001

zbMATH Keywords

conjugacycommutationlanguage equationscanonical decompositionscatenation of languagesmonoid of factorial languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Language equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Commutation with ternary sets of words
• Canonical decomposition of catenation of factorial languages
• Commutation with codes
• The power of commuting with finite sets of words
• Codes et motifs
• Canonical Decomposition of a Regular Factorial Language
• A UNIQUE DECOMPOSITION THEOREM FOR FACTORIAL LANGUAGES
• Commutation of Binary Factorial Languages

This page was built for publication: Simple equations on binary factorial languages