scientific article; zbMATH DE number 3416974
From MaRDI portal
Publication:5681007
zbMATH Open0264.68030MaRDI QIDQ5681007FDOQ5681007
Publication date: 1973
Title of this publication is not available (Why is that?)
Cited In (12)
- Complexity of proper prefix-convex regular languages
- Characterizing the regular prefix codes and right power-bounded languages
- Decision problems for convex languages
- Upper Bound on Syntactic Complexity of Suffix-Free Languages
- Complexity of Left-Ideal, Suffix-Closed and Suffix-Free Regular Languages
- Closure properties of subregular languages under operations
- On posets of \(m\)-ary words
- Quotient complexity of closed languages
- Syntactic complexity of suffix-free languages
- Complexity of proper prefix-convex regular languages
- Complexity of suffix-free regular languages
- Decision Problems for Convex 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)
