scientific article; zbMATH DE number 3416974
From MaRDI portal
Publication:5681007
zbMath0264.68030MaRDI QIDQ5681007
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Complexity of suffix-free regular languages ⋮ On posets of \(m\)-ary words ⋮ Quotient complexity of closed languages ⋮ Syntactic complexity of suffix-free languages ⋮ Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages ⋮ Decision problems for convex languages ⋮ Decision Problems for Convex Languages ⋮ Characterizing the regular prefix codes and right power-bounded languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Complexity of proper prefix-convex regular languages ⋮ Upper Bound on Syntactic Complexity of Suffix-Free Languages ⋮ Closure properties of subregular languages under operations
