Large Aperiodic Semigroups

DOI10.1007/978-3-319-08846-4_9zbMath1302.68154arXiv1401.0157OpenAlexW1526344047MaRDI QIDQ3192257

Marek Szykuła, Janusz A. Brzozowski

Publication date: 26 September 2014

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.0157

zbMATH Keywords

transition semigroupunitaryaperiodicsyntactic complexitymonotonicstar-free languagepartially monotonicsemiconstantnearly monotonic

Mathematics Subject Classification ID

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

Related Items (2)

Checking Whether an Automaton Is Monotonic Is NP-complete ⋮ Descriptional complexity of regular languages

This page was built for publication: Large Aperiodic Semigroups