SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES

DOI10.1142/S0129054114400097zbMath1320.68108OpenAlexW3102169971MaRDI 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

zbMATH Keywords

semigroupregular languagefinite automatonmonoidsyntactic complexity\(\mathcal{J}\)-trivial\(\mathcal{R}\)-trivial

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On Boolean combinations forming piecewise testable languages ⋮ Completely Reachable Automata ⋮ Descriptional complexity of regular languages

Cites Work

• Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
• On deterministic finite automata and syntactic monoid size
• Languages of R-trivial monoids
• \(\mathcal J\)-trivial subsemigroups of finite full transformation semigroups
• On finite monoids having only trivial subgroups

This page was built for publication: SYNTACTIC COMPLEXITY OF ℛ- AND 𝒥-TRIVIAL REGULAR LANGUAGES