Pages that link to "Item:Q840773"
From MaRDI portal
The following pages link to A computational model for tiling recognizable two-dimensional languages (Q840773):
Displaying 16 items.
- Non-expandable non-overlapping sets of pictures (Q346246) (← links)
- Deterministic ordered restarting automata for picture languages (Q748435) (← links)
- Some notes on graph automata, tiling systems and partition logic (Q1273066) (← links)
- Two-dimensional models (Q2074211) (← links)
- Full sets of pictures to encode pictures (Q2422018) (← 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)
- Some classes of rational functions for pictures (Q2969984) (← links)
- Strategies to scan pictures with automata based on Wang tiles (Q3006164) (← links)
- Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932) (← links)
- Snake-Deterministic Tiling Systems (Q3182954) (← links)
- Sets of Pictures Avoiding Overlaps (Q5205035) (← links)
- RESTARTING TILING AUTOMATA (Q5401561) (← links)
- (Q5867524) (← links)
- Weighted three directions OTA and weighted hexapolic picture automata (Q6166836) (← links)