Recommendations
- scientific article; zbMATH DE number 1332661
- scientific article; zbMATH DE number 929620
- The complexity of membership for deterministic growing context-sensitive grammars∗
- Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time
- scientific article; zbMATH DE number 3958759
- Membership for growing context-sensitive grammars is polynomial
- Some results on contextual grammars∗
- scientific article; zbMATH DE number 2150279
- Growing grammars and length-reducing automata
Cites work
- Classes of languages and linear-bounded automata
- scientific article; zbMATH DE number 3936519 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3230262 (Why is no real title available?)
- Membership for growing context-sensitive grammars is polynomial
- Normal forms for context-sensitive grammars
- On certain formal properties of grammars
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On growing context-sensitive languages
- On the complexity of formal grammars
- On the Tape Complexity of Deterministic Context-Free Languages
- Studies in abstract families of languages
- Tree-size bounded alternation
Cited in
(2)
This page was built for publication: On weak growing context-sensitive grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096331)
