Cited in
(53)- Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
- Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981
- A note on Parikh maps, abstract languages, and decision problems
- The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
- Shuffle on trajectories: Syntactic constraints
- Tree transducers, L systems, and two-way machines
- 2DST mappings of languages and related problems
- Upper bounds on recognition of a hierarchy of non-context-free languages
- Learning semilinear sets from examples and via queries
- Commutative grammars
- Classes of formal grammars
- On two-way sequential transductions of full semi-AFL's
- On the generative capacity of simple matrix grammars of finite index
- On the family of finite index matrix languages
- On the synchronization in parallel communicating grammar systems
- Equivalence problem of mappings relative to languages
- Controlled pushdown automata
- A characterization theorem for n-parallel right linear languages
- Min of Mat is not necessarily Mat
- Theory of formal grammars
- Even linear simple matrix languages: formal language properties and grammatical inference.
- Languages of distributed reaction systems
- Finite-turn checking automata
- AFL with the semilinear property
- A note on leftmost restricted random context grammars
- Restricted use of the splicing operation1
- Corrigendum to: ``Simple matrix grammars and their leftmost variants
- dP automata versus right-linear simple matrix grammars
- Single-tape reset machines
- scientific article; zbMATH DE number 3974325 (Why is no real title available?)
- On some open problems about marcus contextual languages
- scientific article; zbMATH DE number 3669877 (Why is no real title available?)
- Characterizations of regular and context-free matrices
- Image theorems for simple matrix languages andn-parallel languages
- On sets of numbers accepted by P/T systems composed by join
- Parallel/sequential rectangular arrays with tables
- On coupled languages and translations
- The complexity of the membership problem for some extensions of context-free languagest†
- An algebraic technique for context-sensitive parsing
- An infinite hierarchy of languages defined by dP systems
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- scientific article; zbMATH DE number 3797186 (Why is no real title available?)
- Pumping lemmas for the control language hierarchy
- Contexts on trajectories
- Language classes generated by tree controlled grammars with bounded nonterminal complexity
- Simple matrix grammars and their leftmost variants
- Multi-pattern languages
- Language classes of extended distributed reaction systems
- On the intersection problem for quantum finite automata
- Cellular automata: communication matters
- Techniques for showing the decidability of the boundedness problem of language acceptors
- First-order logics: some characterizations and closure properties
- The effective entropies of some extensions of context-free languages
This page was built for publication: Simple matrix languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5626293)
