Classes of Languages Generated by the Kleene Star of a Word

DOI10.1007/978-3-662-48057-1_13zbMath1465.68185OpenAlexW4249096603MaRDI QIDQ2946333

Laure Daviaud, Charles Paperman

Publication date: 16 September 2015

Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL: https://openaccess.city.ac.uk/id/eprint/21625/1/MFCS2015.pdf

Mathematics Subject Classification ID

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

Related Items

Classes of languages generated by the Kleene star of a word

Cites Work

• The Birkhoff theorem for finite algebras
• Decomposition of the lattice of pseudovarieties of finite semigroups induced by bands
• Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item