Classes of languages generated by the Kleene star of a word

DOI10.1016/j.ic.2018.07.002zbMath1408.68097OpenAlexW2143540670MaRDI QIDQ1784949

Charles Paperman, Laure Daviaud

Publication date: 27 September 2018

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: http://openaccess.city.ac.uk/id/eprint/21287/1/main.pdf

zbMATH Keywords

decidabilityregular languagefinite automatonKleene starsyntactic monoidprofinite equation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Birkhoff theorem for finite algebras
• Some results on the generalized star-height problem
• On pseudovarieties
• Decomposition of the lattice of pseudovarieties of finite semigroups induced by bands
• Classes of Languages Generated by the Kleene Star of a Word
• Duality and Equational Theory of Regular Languages
• PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
• On finite monoids having only trivial subgroups
• Profinite Methods in Automata Theory

This page was built for publication: Classes of languages generated by the Kleene star of a word