Pages that link to "Item:Q3560552"
From MaRDI portal
The following pages link to Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages (Q3560552):
Displaying 22 items.
- Picture codes and deciphering delay (Q515672) (← links)
- Deterministic ordered restarting automata for picture languages (Q748435) (← links)
- A new characterization of nondeterministically recognizable families of languages (Q808715) (← links)
- A computational model for tiling recognizable two-dimensional languages (Q840773) (← links)
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
- Two-dimensional pattern matching against local and regular-like picture languages (Q2029490) (← links)
- Two-dimensional models (Q2074211) (← links)
- Two-dimensional codes (Q2106615) (← links)
- Characterization and measure of infinite two-dimensional strong prefix codes (Q2201795) (← links)
- Exploring inside tiling recognizable picture languages to find deterministic subclasses (Q2909092) (← links)
- Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory (Q2927640) (← links)
- Unbordered Pictures: Properties and Construction (Q2947146) (← links)
- Structure and properties of strong prefix codes of pictures (Q2971057) (← links)
- Classes of two-dimensional languages and recognizability conditions (Q2998728) (← links)
- On Some Classes of 2D Languages and Their Relations (Q3003537) (← links)
- Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932) (← links)
- (Q3329491) (← links)
- Unambiguous recognizable two-dimensional languages (Q3431439) (← links)
- Towards More Expressive 2D Deterministic Automata (Q5200067) (← links)
- Sets of Pictures Avoiding Overlaps (Q5205035) (← links)
- Automata with cyclic move operations for picture languages (Q5223618) (← links)
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages (Q5428218) (← links)