COMPLEXITY OF ATOMS OF REGULAR LANGUAGES

DOI10.1142/S0129054113400285zbMath1360.68542OpenAlexW1975431188MaRDI QIDQ5495417

Hellis Tamm, Janusz A. Brzozowski

Publication date: 4 August 2014

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054113400285

zbMATH Keywords

regular languagefinite automatonatomsstate complexitysyntactic semigroupwitnessquotient complexityatomic NFA

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Theory of átomata, Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages, Most Complex Non-Returning Regular Languages, Unrestricted State Complexity of Binary Operations on Regular Languages, Descriptional complexity of regular languages

Cites Work

• On the state complexity of reversals of regular languages