Publication:5588662
From MaRDI portal
zbMath0193.32401MaRDI QIDQ5588662
Publication date: 1969
68Q42: Grammars and rewriting systems
Related Items
Unnamed Item, From Contextual Grammars to Range Concatenation Grammars, Contextual grammars with distributed catenation and shuffle, An Overview of 2D Picture Array Generating Models Based on Membrane Computing, Generative Capacity of Contextual Grammars with Subregular Selection Languages*, On Contextual Grammars with Subregular Selection Languages, k-Local Internal Contextual Grammars, Unnamed Item, Logical string rewriting, Single semi-contextual insertion-deletion systems, One-Way Restarting Automata and Their Sensitivitys, On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2, Merging two hierarchies of external contextual grammars with subregular selection, Generating and accepting P systems with minimal left and right insertion and deletion, On external contextual grammars with subregular selection languages, Contextual array grammars and array P systems, Bounded hairpin completion, Computational power of insertion-deletion (P) systems with rules of size two, P systems with minimal insertion and deletion, Matrix insertion-deletion systems, Marcus \(t\)-contextual grammars and cut hierarchies and monotonicity for restarting automata, Degrees of non-monotonicity for restarting automata, A note on ambiguity of internal contextual grammars, Fundamental methodological issues of syntactic pattern recognition, On the weight of universal insertion grammars, Iterative learning of simple external contextual languages, On branching and looping. I, Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages, On representing recursively enumerable languages by internal contextual languages, Characterizations of recursively enumerable languages by means of insertion grammars, On computational complexity of contextual languages, On path-controlled insertion-deletion systems, Context-free insertion-deletion systems, On the splicing operation, Remarks on external contextual grammars with selection, On the computing powers of \(\mathcal{L}\)-reductions of insertion languages, Universal insertion grammars of size two, Parallel contextual array insertion deletion P systems and tabled matrix grammars, Contextual array grammars with matrix control, regular control languages, and tissue P systems control, Sorted dependency insertion grammars, Computational completeness of path-structured graph-controlled insertion-deletion systems, Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion, Maximally Parallel Contextual String Rewriting, Contextual Array Grammars with Matrix and Regular Control, Circular Post Machines and P Systems with Exo-insertion and Deletion, Non-isometric Contextual Array Grammars with Regular Control and Local Selectors, Natural Language Processing, Moving from Rules to Data, Context Insertions, Unnamed Item, Contextual grammars vs. context-free algebras, Iterative Learning of Simple External Contextual Languages, Further Results on Insertion-Deletion Systems with One-Sided Contexts, Bounded Hairpin Completion, Unnamed Item, Unnamed Item
