Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
From MaRDI portal
Cites work
- Classes of languages and linear-bounded automata
- From regular to strictly locally testable languages
- Generative capacity of subregularly tree controlled grammars
- scientific article; zbMATH DE number 3646310 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 50943 (Why is no real title available?)
- scientific article; zbMATH DE number 3473324 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 3802813 (Why is no real title available?)
- scientific article; zbMATH DE number 3293675 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- Multiple-entry finite automata
- On contextual grammars with subregular selection languages
- On the generative capacity of tree controlled grammars
- On the nonterminal complexity of tree controlled grammars
- Power-separating regular languages
- The Theory of Definite Automata
- Tree controlled grammars
- Two collapsing hierarchies of subregularly tree controlled languages
This page was built for publication: Strictly Locally Testable and Resources Restricted Control Languages in Tree-Controlled Grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204140)
