scientific article
From MaRDI portal
Publication:2965987
zbMath1401.68214arXiv1511.00157MaRDI QIDQ2965987
Sylvie Davies, Bo Liu, Janusz A. Brzozowski
Publication date: 3 March 2017
Full work available at URL: https://arxiv.org/abs/1511.00157
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
atomidealregular languagestate complexityquotientsyntactic semigroupmost complexbasic operationsuniversal witness
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 Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages ⋮ Most Complex Non-Returning Regular Languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Primitivity, uniform minimality, and state complexity of Boolean operations
This page was built for publication:
