scientific article; zbMATH DE number 3307580
From MaRDI portal
Publication:5588662
zbMath0193.32401MaRDI QIDQ5588662
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (60)
Contextual array grammars with matrix control, regular control languages, and tissue P systems control ⋮ Circular Post Machines and P Systems with Exo-insertion and Deletion ⋮ Sorted dependency insertion grammars ⋮ Contextual grammars with distributed catenation and shuffle ⋮ 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 ⋮ Computational completeness of path-structured graph-controlled insertion-deletion systems ⋮ On the splicing operation ⋮ Unnamed Item ⋮ Non-isometric Contextual Array Grammars with Regular Control and Local Selectors ⋮ On branching and looping. I ⋮ On computational complexity of contextual languages ⋮ P systems with minimal insertion and deletion ⋮ Investigations on the power of matrix insertion-deletion systems with small sizes ⋮ Contextual grammars vs. context-free algebras ⋮ Single semi-contextual insertion-deletion systems ⋮ Unnamed Item ⋮ One-Way Restarting Automata and Their Sensitivitys ⋮ Parallel contextual array insertion deletion grammars, pure 2D context-free grammars and associated P systems ⋮ On homomorphic images of the Szilard languages of matrix insertion-deletion systems with matrices of size 2 ⋮ An Overview of 2D Picture Array Generating Models Based on Membrane Computing ⋮ Merging two hierarchies of external contextual grammars with subregular selection ⋮ Fundamental methodological issues of syntactic pattern recognition ⋮ Relations of contextual grammars with strictly locally testable selection languages ⋮ When Stars Control a Grammar's Work ⋮ On external contextual grammars with subregular selection languages ⋮ Generalization of the Ginsburg-Rice Schuetzenberger fixed-point theorem for context-sensitive and recursive-enumerable languages ⋮ Unnamed Item ⋮ On path-controlled insertion-deletion systems ⋮ Iterative Learning of Simple External Contextual Languages ⋮ Unnamed Item ⋮ On the weight of universal insertion grammars ⋮ Natural Language Processing, Moving from Rules to Data ⋮ Further Results on Insertion-Deletion Systems with One-Sided Contexts ⋮ Unnamed Item ⋮ Contextual array grammars and array P systems ⋮ Context Insertions ⋮ Generative Capacity of Contextual Grammars with Subregular Selection Languages* ⋮ Remarks on external contextual grammars with selection ⋮ On the computing powers of \(\mathcal{L}\)-reductions of insertion languages ⋮ Universal insertion grammars of size two ⋮ From Contextual Grammars to Range Concatenation Grammars ⋮ Context-free insertion-deletion systems ⋮ Bounded hairpin completion ⋮ Computational power of insertion-deletion (P) systems with rules of size two ⋮ Logical string rewriting ⋮ Iterative learning of simple external contextual languages ⋮ Matrix insertion-deletion systems ⋮ On Contextual Grammars with Subregular Selection Languages ⋮ k-Local Internal Contextual Grammars ⋮ Bounded Hairpin Completion ⋮ Generative Power of Matrix Insertion-Deletion Systems with Context-Free Insertion or Deletion ⋮ Parallel contextual array insertion deletion P systems and tabled matrix grammars ⋮ On representing recursively enumerable languages by internal contextual languages ⋮ Characterizations of recursively enumerable languages by means of insertion grammars ⋮ Maximally Parallel Contextual String Rewriting ⋮ Contextual Array Grammars with Matrix and Regular Control ⋮ Unnamed Item ⋮ Generating and accepting P systems with minimal left and right insertion and deletion
This page was built for publication:
