Most Complex Regular Right-Ideal Languages

DOI10.1007/978-3-319-09704-6_9zbMath1400.68128arXiv1311.4448OpenAlexW2159447498MaRDI QIDQ5496180

Gareth T. Davies, Janusz A. Brzozowski

Publication date: 7 August 2014

Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)

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

zbMATH Keywords

atomregular languagestate complexityquotientoperationright idealsyntactic semigroupuniversal witness

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

Complexity of suffix-free regular languages ⋮ Complexity of Suffix-Free Regular Languages

This page was built for publication: Most Complex Regular Right-Ideal Languages