Pages that link to "Item:Q1326955"
From MaRDI portal
The following pages link to Nondeterminism versus determinism of finite automata over directed acyclic graphs (Q1326955):
Displayed 9 items.
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
- Some notes on graph automata, tiling systems and partition logic (Q1273066) (← links)
- Grammatical inference of directed acyclic graph languages with polynomial time complexity (Q1747486) (← links)
- Language theoretic properties of regular DAG languages (Q2272978) (← links)
- Communication complexity tools on recognizable picture languages (Q2330109) (← links)
- Classes of two-dimensional languages and recognizability conditions (Q2998728) (← links)
- Unambiguous recognizable two-dimensional languages (Q3431439) (← links)
- Tiling Recognizable Two-Dimensional Languages (Q3522860) (← links)
- Deterministic Two-Dimensional Languages over One-Letter Alphabet (Q3522864) (← links)