scientific article; zbMATH DE number 3416974
From MaRDI portal
Publication:5681007
Cited in
(11)- Upper bound on syntactic complexity of suffix-free 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 suffix-free regular languages
- Decision Problems for Convex Languages
- Closure properties of subregular languages under operations
- On posets of \(m\)-ary words
- Syntactic complexity of suffix-free languages
- Complexity of proper prefix-convex regular languages
- Complexity of left-ideal, suffix-closed and suffix-free regular languages
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5681007)
