Pages that link to "Item:Q1075759"
From MaRDI portal
The following pages link to Three-way automata on rectangular types over a one-letter alphabet (Q1075759):
Displayed 9 items.
- A computational model for tiling recognizable two-dimensional languages (Q840773) (← links)
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
- Simple picture processing based on finite automata and regular grammars (Q1747512) (← links)
- Decision problems and projection languages for restricted variants of two-dimensional automata (Q2029491) (← links)
- New operations and regular expressions for two-dimensional languages over one-letter alphabet (Q2484449) (← links)
- A survey of two-dimensional automata theory (Q2638801) (← links)
- A Survey on Picture-Walking Automata (Q3098039) (← links)
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages (Q3503914) (← links)
- Deterministic Two-Dimensional Languages over One-Letter Alphabet (Q3522864) (← links)