scientific article; zbMATH DE number 2040895

MaRDI QIDQ4452051zbMATH OpenFDO

Authors Antonio Cano Gómez, Jean-Éric Pin

Publication date 11 February 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2710/27100035.htm

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• A non-ambiguous decomposition of regular languages and factorizing codes
• Disjunctive decomposition of languages
• A non-ambiguous language factorization problem
• scientific article; zbMATH DE number 1528638
• On the decomposition of finite languages

Cited in

(11)

• On the conjecture of Schauder
• Berge-Fulkerson conjecture on certain snarks
• Decidable first-order transition logics for PA-processes
• On the Bogomolny-Schmit conjecture
• Efficiency of automata in semi-commutation verification techniques
• A Robust Class of Regular Languages
• scientific article; zbMATH DE number 3953175 (Why is no real title available?)
• Regular languages and partial commutations
• On the Schertz Conjecture
• Some results on the Flynn–Poonen–Schaefer conjecture
• Shuffle product of regular languages: results and open problems

This page was built for publication:

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