Simple matrix languages
From MaRDI portal
Publication:5626293
DOI10.1016/S0019-9958(70)80034-1zbMath0221.68041OpenAlexW2061759138MaRDI QIDQ5626293
Publication date: 1970
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(70)80034-1
Related Items (49)
dP Automata versus Right-Linear Simple Matrix Grammars ⋮ Single-tape reset machines ⋮ The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index ⋮ Equivalence problem of mappings relative to languages ⋮ On some open problems about marcus contextual languages ⋮ Pumping lemmas for the control language hierarchy ⋮ Unnamed Item ⋮ Shuffle on trajectories: Syntactic constraints ⋮ Tree transducers, L systems, and two-way machines ⋮ Controlled pushdown automata ⋮ A characterization theorem for n-parallel right linear languages ⋮ On sets of numbers accepted by P/T systems composed by join ⋮ An infinite hierarchy of languages defined by dP systems ⋮ Unnamed Item ⋮ Characterizations of regular and context-free matrices ⋮ Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ 2DST mappings of languages and related problems ⋮ Restricted use of the splicing operation1 ⋮ Image theorems for simple matrix languages andn-parallel languages ⋮ Multi-pattern languages ⋮ Upper bounds on recognition of a hierarchy of non-context-free languages ⋮ Learning semilinear sets from examples and via queries ⋮ Simple Matrix Grammars and Their Leftmost Variants ⋮ Parallel/sequential rectangular arrays with tables ⋮ On coupled languages and translations ⋮ Contexts on trajectories ⋮ First-order logics: some characterizations and closure properties ⋮ Commutative grammars ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity ⋮ 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 ⋮ Two complementary operations inspired by the DNA hairpin formation: Completion and reduction ⋮ On the family of finite index matrix languages ⋮ The complexity of the membership problem for some extensions of context-free languagest† ⋮ Unnamed Item ⋮ An algebraic technique for context-sensitive parsing ⋮ The effective entropies of some extensions of context-free languages ⋮ Finite-turn checking automata ⋮ Corrigendum: "Simple Matrix Grammars and Their Leftmost Variants [3"] ⋮ AFL with the semilinear property ⋮ A note on leftmost restricted random context grammars ⋮ Theory of formal grammars ⋮ Modelling economic processes by means of formal grammars: A survey of results at the middle of 1981 ⋮ Even linear simple matrix languages: formal language properties and grammatical inference. ⋮ Languages of distributed reaction systems ⋮ A note on Parikh maps, abstract languages, and decision problems ⋮ Min of Mat is not necessarily Mat ⋮ On the synchronization in parallel communicating grammar systems
This page was built for publication: Simple matrix languages
