scientific article; zbMATH DE number 5218131

MaRDI QIDQ5429965zbMATH OpenFDO

Authors Laura Chaubard, Jean-Éric Pin

Publication date 5 December 2007

zbMATH Keywords

Boolean operationsfinite automataformal languagesinverse morphismsmarked productsoperations on languagesregular languagesshuffle productsstar productssyntactic monoids

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• Open problems about regular languages, 35 years later
• scientific article; zbMATH DE number 1134630
• Towards a theory of complexity of regular languages
• On decidability of regular languages theories
• On the boundary of regular languages
• On the boundary of regular languages
• scientific article; zbMATH DE number 3911727
• The dissecting power of regular languages
• Regular languages viewed from a graph-theoretic perspective
• scientific article; zbMATH DE number 7699973

Cited in

(5)

• Generic results for concatenation hierarchies
• A survey of combinatorial semigroups: characterizing and generalizing regular languages by semifilters.
• scientific article; zbMATH DE number 3874645 (Why is no real title available?)
• A Robust Class of Regular Languages
• Open problems about regular languages, 35 years later

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 Q5429965)