Large aperiodic semigroups

DOI10.1142/S0129054115400067MaRDI QIDQ5744128zbMATH OpenOpenAlexFDO

Authors Marek Szykuła, Janusz Brzozowski

Publication date 17 February 2016

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054115400067

zbMATH Keywords

aperiodicmonotonicsemiconstantstar-free languagesyntactic complexitytransition semigroupunitary

Mathematics Subject Classification ID

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

Recommendations

• Large Aperiodic Semigroups
• scientific article; zbMATH DE number 2040919
• scientific article; zbMATH DE number 1254105
• On nonpermutational transformation semigroups with an application to syntactic complexity
• The problem on automaticity of semigroups of regular languages.

Cites work

• About Some Properties of Definite, Reverse-Definite and Related Automata
• Generating small automata and the Černý conjecture
• In search of most complex regular languages
• Languages of R-trivial monoids
• On finite monoids having only trivial subgroups
• On the ranks of certain semigroups of order-preserving transformations
• Products of idempotents in certain semigroups of transformations
• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES

Cited in

(7)

• Semiregular large sets
• Syntactic complexity of bifix-free regular languages
• Syntactic complexity of bifix-free languages
• Large Aperiodic Semigroups
• Square, power, positive closure, and complementation on ordered and star-free languages
• Syntactic complexity of regular ideals
• A cornering strategy for synchronizing a DFA

This page was built for publication: Large aperiodic semigroups

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