Publication:5306170
From MaRDI portal
zbMath1199.68168MaRDI QIDQ5306170
Thomas Ang, Janusz A. Brzozowski
Publication date: 8 April 2010
free; language; ideal; convex; code; factor; relation; prefix; closure; factorial; subword; closed; suffix
68Q45: Formal languages and automata
Related Items
Upper Bound on Syntactic Complexity of Suffix-Free Languages, Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages, Complexity of proper prefix-convex regular languages, Complexity of proper prefix-convex regular languages, Decision problems for convex languages, Syntactic complexity of regular ideals, Quotient complexity of closed languages, Syntactic complexity of suffix-free languages, Descriptional complexity of regular languages, Closure properties of subregular languages under operations, Complexity of suffix-free regular languages, Complexity of Suffix-Free Regular Languages