Quotient Complexities of Atoms in Regular Ideal Languages
From MaRDI portal
Publication:2803047
DOI10.14232/actacyb.22.2.2015.4zbMath1349.68122arXiv1503.02208OpenAlexW2964038633MaRDI QIDQ2803047
Sylvie Davies, Janusz A. Brzozowski
Publication date: 3 May 2016
Published in: Acta Cybernetica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.02208
atomregular languagestate complexityleft idealquotientright idealsyntactic semigrouptwo-sided idealquotient complexity
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items (6)
Complexity of suffix-free regular languages ⋮ Complexity of Suffix-Free Regular Languages ⋮ Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages ⋮ Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited ⋮ Most Complex Non-Returning Regular Languages ⋮ Complexity of atoms, combinatorially
This page was built for publication: Quotient Complexities of Atoms in Regular Ideal Languages