scientific article; zbMATH DE number 5691259

zbMath1199.68168MaRDI QIDQ5306170

Thomas Ang, Janusz A. Brzozowski

Publication date: 8 April 2010

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

freelanguageidealconvexcodefactorrelationprefixclosurefactorialsubwordclosedsuffix

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Complexity of suffix-free regular languages, Quotient complexity of closed languages, Complexity of Suffix-Free Regular Languages, Syntactic complexity of suffix-free languages, Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages, Decision problems for convex languages, Syntactic complexity of regular ideals, Complexity of proper prefix-convex regular languages, Complexity of proper prefix-convex regular languages, Descriptional complexity of regular languages, Upper Bound on Syntactic Complexity of Suffix-Free Languages, Closure properties of subregular languages under operations