Syntactic Complexity of Ideal and Closed Languages

DOI10.1007/978-3-642-22321-1_11zbMath1221.68118arXiv1010.3263OpenAlexW1495359240MaRDI QIDQ5199958

Yuli Ye, Janusz A. Brzozowski

Publication date: 29 July 2011

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.3263

zbMATH Keywords

complexitysemigrouplanguageidealregularmonoidautomatonclosedreversalsyntactic

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (14)

Topological entropy of formal languages ⋮ Syntactic complexity of bifix-free languages ⋮ Complexity of suffix-free regular languages ⋮ Complexity of Suffix-Free Regular Languages ⋮ Extremal minimality conditions on automata ⋮ Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages ⋮ Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages ⋮ Syntactic complexity of regular ideals ⋮ Syntactic Complexity of Prefix-, Suffix-, and Bifix-Free Regular Languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Syntactic complexity of bifix-free regular languages ⋮ Upper Bound on Syntactic Complexity of Suffix-Free Languages ⋮ Square on Ideal, Closed and Free Languages

This page was built for publication: Syntactic Complexity of Ideal and Closed Languages