Pages that link to "Item:Q3431439"
From MaRDI portal
The following pages link to Unambiguous recognizable two-dimensional languages (Q3431439):
Displayed 14 items.
- A computational model for tiling recognizable two-dimensional languages (Q840773) (← links)
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
- Characterizations of recognizable picture series (Q1022605) (← links)
- Weighted picture automata and weighted logics (Q2429722) (← links)
- Classes of two-dimensional languages and recognizability conditions (Q2998728) (← links)
- Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932) (← links)
- Snake-Deterministic Tiling Systems (Q3182954) (← links)
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages (Q3503914) (← links)
- Tiling Recognizable Two-Dimensional Languages (Q3522860) (← links)
- Recognizable vs. Regular Picture Languages (Q3522862) (← links)
- Deterministic Two-Dimensional Languages over One-Letter Alphabet (Q3522864) (← links)
- Framed Versus Unframed Two-Dimensional Languages (Q3599066) (← links)
- On Complexity of Two Dimensional Languages Generated by Transducers (Q3602813) (← links)
- Transducer generated arrays of robotic nano-arms (Q5962069) (← links)