Power-separating regular languages
From MaRDI portal
Cites work
Cited in
(17)- Operations on subregular languages and nondeterministic state complexity
- scientific article; zbMATH DE number 3576711 (Why is no real title available?)
- Nondeterministic state complexity of star-free languages
- Nondeterministic state complexity of star-free languages
- On the generative capacity of contextual grammars with strictly locally testable selection languages
- Closure properties of subregular languages under operations
- Relations of contextual grammars with strictly locally testable selection languages
- Left-noncounting languages
- Accepting networks of evolutionary processors with resources restricted and structure limited filters
- Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
- Nondeterministic operational complexity in subregular languages
- Merging two hierarchies of external contextual grammars with subregular selection
- scientific article; zbMATH DE number 7347652 (Why is no real title available?)
- Determination of finite automata accepting subregular languages
- Generative capacity of contextual grammars with subregular selection languages
- Decision problems for subregular classes
- The magic number problem for subregular language families
This page was built for publication: Power-separating regular languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4775487)
