Most Complex Non-Returning Regular Languages
From MaRDI portal
Publication:5205037
DOI10.1142/S0129054119400239zbMath1427.68139MaRDI QIDQ5205037
Janusz A. Brzozowski, Sylvie Davies
Publication date: 10 December 2019
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
atom; regular language; transition semigroup; state complexity; star; concatenation; reversal; Boolean operation; syntactic semigroup; different alphabets; most complex; unrestricted complexity