scientific article; zbMATH DE number 3230262
From MaRDI portal
Publication:5518372
Cited in
(15)- Complexity theory for splicing systems
- Deterministic multitape automata computations
- On weak growing context-sensitive grammars
- On the degrees of non-regularity and non-context-freeness
- Membership for growing context-sensitive grammars is polynomial
- On the extension of Gladkij's theorem and the hierarchies of languages
- Complex systems, complexity measures, grammars and model-inferring
- Growing context-sensitive languages and Church-Rosser languages
- Grammars with valuations - a discrete model for self-organization of biopolymers
- Sweeping input-driven pushdown automata
- Lower bound technique for length-reducing automata
- On grammars, complexity, and information measures of biological macromolecules
- The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages
- On growing context-sensitive languages
- Time-bounded grammars and their languages
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 Q5518372)
