Large Aperiodic Semigroups

DOI10.1142/S0129054115400067zbMath1330.68147OpenAlexW2336446049MaRDI QIDQ5744128

Marek Szykuła, Janusz A. 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

transition semigroupunitaryaperiodicsyntactic complexitymonotonicstar-free languagesemiconstant

Mathematics Subject Classification ID

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

Related Items (3)

Syntactic complexity of bifix-free languages ⋮ Syntactic complexity of regular ideals ⋮ Syntactic complexity of bifix-free regular languages

Cites Work

• Languages of R-trivial monoids
• On the ranks of certain semigroups of order-preserving transformations
• QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES
• Generating Small Automata and the Černý Conjecture
• On finite monoids having only trivial subgroups
• IN SEARCH OF MOST COMPLEX REGULAR LANGUAGES
• About Some Properties of Definite, Reverse-Definite and Related Automata
• Products of idempotents in certain semigroups of transformations

This page was built for publication: Large Aperiodic Semigroups