Languages recognized by finite supersoluble groups

DOI10.25596/JALC-2009-149MaRDI QIDQ3589632zbMATH OpenFDO

Authors Olivier Carton, Jean-Éric Pin, Xaro Soler-Escrivà

Publication date 20 September 2010

zbMATH Keywords

regular languageBoolean algebrarepresentation theory

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Recommendations

• scientific article; zbMATH DE number 4041299
• scientific article; zbMATH DE number 1972789
• Extended finite automata over groups
• Languages recognized by finite aperiodic groupoids
• Languages recognized by finite aperiodic groupoids

Cited in

(5)

• State complexity of projection on languages recognized by permutation automata and commuting letters
• scientific article; zbMATH DE number 1744112 (Why is no real title available?)
• Literal Varieties of Languages Induced by Homomorphisms onto Nilpotent Groups
• scientific article; zbMATH DE number 988805 (Why is no real title available?)
• Languages and formations generated by \(D_4\) and \(Q_8\)

This page was built for publication: Languages recognized by finite supersoluble groups

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