Picture languages with array rewriting rules
From MaRDI portal
Publication:5683717
DOI10.1016/S0019-9958(73)90573-1zbMath0266.68037OpenAlexW2093758017MaRDI QIDQ5683717
Gift Siromoney, Rani Siromoney, Kamala Krithivasan
Publication date: 1973
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(73)90573-1
Related Items (48)
A note on regular-controlled apical-growth filamentous systems ⋮ A CKY parser for picture grammars ⋮ Exact and approximate matching of matrix languages ⋮ Contextual array P systems ⋮ Parallel generation of infinite images ⋮ Context-sensitive string languages and recognizable picture languages ⋮ A note on regular Kolam array grammars generating right triangles ⋮ (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Two dimensional fuzzy regular languages ⋮ A note on closure properties of the classes of sets accepted by tape- bounded two-dimensional Turing machines ⋮ Unnamed Item ⋮ Non-recursive trade-offs between two-dimensional automata and grammars ⋮ 2D oxide picture languages and their properties ⋮ Lyndon partial words and arrays with applications ⋮ Three-way tape-bounded two-dimensional Turing machines ⋮ Parallel contextual array insertion deletion grammars, pure 2D context-free grammars and associated P systems ⋮ Array P systems and pure 2D context-free grammars with independent mode of rewriting ⋮ An Overview of 2D Picture Array Generating Models Based on Membrane Computing ⋮ Weighted three directions OTA and weighted hexapolic picture automata ⋮ A \(P\) system model with pure context-free rules for picture array generation ⋮ ON ARRAY GRAMMARS AND LANGUAGES ⋮ Selective substitution array grammars ⋮ EOL and ETOL array languages ⋮ Array automata and operations on array languages ⋮ On the generative capacity of compound string and array grammars ⋮ Index on etol array languages ⋮ Machine characterization of eol-regular matrix systems ⋮ On Some Classes of 2D Languages and Their Relations ⋮ Shuffle on Trajectories over Finite Array Languages ⋮ Possibilities of constructing two dimensional pictures in DNA computing: Part I ⋮ Networks of picture processors as problem solvers ⋮ Simple picture processing based on finite automata and regular grammars ⋮ Pure 2D picture grammars and languages ⋮ A unifying approach to picture grammars ⋮ A note on two-dimensional finite automata ⋮ Possibilities of constructing two dimensional pictures in DNA computing: Part II ⋮ Variations of the matrix models ⋮ Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines ⋮ A note on two-dimensional probabilistic Turing machines ⋮ Two-dimensional models ⋮ Infinite arrays and infinite computations ⋮ Table matrix L systems ⋮ A note on two-dimensional probabilistic finite automata ⋮ Expressiveness and complexity of regular pure two-dimensional context-free languages ⋮ Infinite arrays and controlled deterministic table 0L array systems ⋮ Undecidability of the emptiness problem for context-free picture languages
This page was built for publication: Picture languages with array rewriting rules
