The syntactic complexity of semi-flower languages
From MaRDI portal
(Redirected from Publication:2179334)
Recommendations
- On syntactic complexity of circular semi-flower automata
- Syntactic complexity of suffix-free languages
- Syntactic complexities of some classes of star-free languages
- Syntactic complexities of six classes of star-free languages
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
Cited in
(2)
This page was built for publication: The syntactic complexity of semi-flower languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179334)