Pages that link to "Item:Q3522862"
From MaRDI portal
The following pages link to Recognizable vs. Regular Picture Languages (Q3522862):
Displaying 5 items.
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Recognizable vs. Regular Picture Languages (Q3522862) (← links)
- Recognizable languages of arrows and cospans (Q4585008) (← links)
- Two-Dimensional Palindromes and Their Properties (Q5738994) (← links)