Simple matrix languages

Cited In (49)

Simple matrix grammars and their leftmost variants
A note on leftmost restricted random context grammars
On coupled languages and translations
Corrigendum to: ``Simple matrix grammars and their leftmost variants
Languages of distributed reaction systems
A characterization theorem for n-parallel right linear languages
Contexts on trajectories
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
Min of Mat is not necessarily Mat
The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
Shuffle on trajectories: Syntactic constraints
Learning semilinear sets from examples and via queries
An infinite hierarchy of languages defined by dP systems
Theory of formal grammars
Multi-pattern languages
The complexity of the membership problem for some extensions of context-free languagest†
2DST mappings of languages and related problems
Two complementary operations inspired by the DNA hairpin formation: Completion and reduction
Title not available (Why is that?)
Language classes generated by tree controlled grammars with bounded nonterminal complexity
Language classes generated by tree controlled grammars with bounded nonterminal complexity
Restricted use of the splicing operation¹
On sets of numbers accepted by P/T systems composed by join
dP automata versus right-linear simple matrix grammars
Image theorems for simple matrix languages andn-parallel languages
On some open problems about marcus contextual languages
Tree transducers, L systems, and two-way machines
Upper bounds on recognition of a hierarchy of non-context-free languages
Commutative grammars
Title not available (Why is that?)
The effective entropies of some extensions of context-free languages
On the family of finite index matrix languages
On the synchronization in parallel communicating grammar systems
First-order logics: some characterizations and closure properties
Parallel/sequential rectangular arrays with tables
Characterizations of regular and context-free matrices
Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981
An algebraic technique for context-sensitive parsing
Single-tape reset machines
Pumping lemmas for the control language hierarchy
Finite-turn checking automata
A note on Parikh maps, abstract languages, and decision problems
Equivalence problem of mappings relative to languages
Title not available (Why is that?)
Controlled pushdown automata
Even linear simple matrix languages: formal language properties and grammatical inference.
AFL with the semilinear property

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)