Pages that link to "Item:Q5683717"
From MaRDI portal
The following pages link to Picture languages with array rewriting rules (Q5683717):
Displaying 30 items.
- A \(P\) system model with pure context-free rules for picture array generation (Q630739) (← links)
- A unifying approach to picture grammars (Q719247) (← links)
- Infinite arrays and controlled deterministic table 0L array systems (Q797993) (← links)
- Non-recursive trade-offs between two-dimensional automata and grammars (Q896688) (← links)
- Pure 2D picture grammars and languages (Q967399) (← links)
- A note on regular Kolam array grammars generating right triangles (Q1133329) (← links)
- A note on closure properties of the classes of sets accepted by tape- bounded two-dimensional Turing machines (Q1140989) (← links)
- Three-way tape-bounded two-dimensional Turing machines (Q1143793) (← links)
- Selective substitution array grammars (Q1153689) (← links)
- EOL and ETOL array languages (Q1155372) (← links)
- On the generative capacity of compound string and array grammars (Q1171392) (← links)
- A note on two-dimensional finite automata (Q1245102) (← links)
- A note on two-dimensional probabilistic finite automata (Q1298347) (← links)
- Context-sensitive string languages and recognizable picture languages (Q1376420) (← links)
- Networks of picture processors as problem solvers (Q1746794) (← links)
- Simple picture processing based on finite automata and regular grammars (Q1747512) (← links)
- Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic Turing machines (Q1818780) (← links)
- A note on two-dimensional probabilistic Turing machines (Q1818955) (← links)
- Infinite arrays and infinite computations (Q1838321) (← links)
- Two-dimensional models (Q2074211) (← links)
- Undecidability of the emptiness problem for context-free picture languages (Q2357111) (← links)
- A CKY parser for picture grammars (Q2380077) (← links)
- Expressiveness and complexity of regular pure two-dimensional context-free languages (Q2855787) (← links)
- (Un)decidability of the Emptiness Problem for Multi-dimensional Context-Free Grammars (Q2947427) (← links)
- On Some Classes of 2D Languages and Their Relations (Q3003537) (← links)
- Shuffle on Trajectories over Finite Array Languages (Q3003541) (← links)
- Possibilities of constructing two dimensional pictures in DNA computing: Part II (Q3375519) (← links)
- Two dimensional fuzzy regular languages (Q6079412) (← links)
- Parallel contextual array insertion deletion grammars, pure 2D context-free grammars and associated P systems (Q6122591) (← links)
- Array P systems and pure 2D context-free grammars with independent mode of rewriting (Q6135704) (← links)