Syntactic complexities of six classes of star-free languages
From MaRDI portal
Publication:5178449
DOI10.25596/JALC-2012-083zbMATH Open1322.68118MaRDI QIDQ5178449FDOQ5178449
Authors: Baiyu Li, David Liu, Janusz Brzozowski 
Publication date: 16 March 2015
Recommendations
- Syntactic complexities of some classes of star-free languages
- Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
- Syntactic complexity of \({\mathcal R}\)- and \({\mathcal J}\)-trivial regular languages
- Syntactic complexity of \(\mathcal{R}\)- and \(\mathcal{J}\)-trivial regular languages
finite automatonsyntactic complexityfinite languagesyntactic semigroupstar-free languagemonotonic automatoncofinite languagedefinite languagepartially monotonic automatonreverse definite language
Cited In (13)
- On syntactic complexity of circular semi-flower automata
- Forbidden patterns for ordered automata
- Syntactic complexity of regular ideals
- Nondeterministic state complexity of star-free languages
- Checking whether an automaton is monotonic is NP-complete
- Syntactic complexity of suffix-free languages
- Syntactic complexity of prefix-, suffix-, and bifix-free regular languages
- Syntactic complexities of some classes of star-free languages
- The syntactic complexity of semi-flower languages
- Syntactic complexity of bifix-free regular languages
- Descriptional complexity of regular languages
- Syntactic complexity of bifix-free languages
- On the Complexity of the Syntax of Tree Languages
This page was built for publication: Syntactic complexities of six classes of star-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5178449)
