Most complex non-returning regular languages
From MaRDI portal
Publication:2400992
DOI10.1007/978-3-319-60252-3_7zbMath1426.68139arXiv1701.03944OpenAlexW2579020504MaRDI QIDQ2400992
Sylvie Davies, Janusz A. Brzozowski
Publication date: 31 August 2017
Full work available at URL: https://arxiv.org/abs/1701.03944
atomtransition semigroupstate complexitystarconcatenationreversalBoolean operationsyntactic semigroupdifferent alphabetsnon-returningunrestricted complexity
Related Items (1)
This page was built for publication: Most complex non-returning regular languages