Regular component decomposition of regular languages.

DOI10.1016/S0304-3975(02)00064-6MaRDI QIDQ1874420zbMATH OpenFDO

Authors Yanyan Li, Yaojun Liu

Publication date 25 May 2003

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

Full work available at URL https://doi.org/10.1016/S0304-3975(02)00064-6

zbMATH Keywords

AutomatonCodeRegular languageSemigroup

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Regular component splittable languages
• A non-ambiguous language factorization problem
• scientific article; zbMATH DE number 3902063
• Prime Decompositions of Regular Languages
• Shuffle decomposition of regular languages

Cites work

• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• Regular component splittable languages
• The single loop representations of regular languages

Cited in

(6)

• Regular component splittable languages
• The single loop representations of regular languages
• A non-ambiguous decomposition of regular languages and factorizing codes
• scientific article; zbMATH DE number 3919851 (Why is no real title available?)
• Every regular bifix code is a finite union of regular infix codes
• Multi-decision diagnosis: decentralized architectures cooperating for diagnosing the presence of faults in discrete event systems

This page was built for publication: Regular component decomposition of regular languages.

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