scientific article; zbMATH DE number 3254902
From MaRDI portal
Publication:5541336
Cites work
Cited in
(27)- Concerning two-adjacent context-free languages
- On commutative context-free languages
- Concise description of finite languages
- Descriptional complexity of context-free grammar forms
- On an extension of the class of context-free languages
- Fast deterministic parsers for transition networks
- Syntactic complexity of context-free grammars over word monoids
- Simulating finite automata with context-free grammars.
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
- On the cover complexity of finite languages
- A characterization of context-free languages
- Conditional Lindenmayer systems with conditions defined by bounded resources
- Contextual grammars vs. context-free algebras
- Context-Free Languages of Countable Words
- scientific article; zbMATH DE number 5309909 (Why is no real title available?)
- scientific article; zbMATH DE number 3974325 (Why is no real title available?)
- scientific article; zbMATH DE number 4011962 (Why is no real title available?)
- scientific article; zbMATH DE number 23770 (Why is no real title available?)
- scientific article; zbMATH DE number 97565 (Why is no real title available?)
- Context free closed families of languages
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- scientific article; zbMATH DE number 3381865 (Why is no real title available?)
- Pareto grammars
- Non-simple rule counting in semi-conditional grammars
- On context-free and Szilard languages
- On bounded interpretations of grammar forms
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 Q5541336)
