SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES
From MaRDI portal
Publication:5173287
DOI10.1142/S0129054114400097zbMath1320.68108MaRDI QIDQ5173287
Baiyu Li, Janusz A. Brzozowski
Publication date: 9 February 2015
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054114400097
semigroup; regular language; finite automaton; monoid; syntactic complexity; \(\mathcal{J}\)-trivial; \(\mathcal{R}\)-trivial
68Q45: Formal languages and automata
Related Items
Descriptional complexity of regular languages, On Boolean combinations forming piecewise testable languages, Completely Reachable Automata
Cites Work