Pages that link to "Item:Q1292300"
From MaRDI portal
The following pages link to A characterization of recognizable picture languages by tilings by finite sets (Q1292300):
Displaying 15 items.
- Picture codes and deciphering delay (Q515672) (← links)
- A unifying approach to picture grammars (Q719247) (← links)
- Two-dimensional comma-free and cylindric codes (Q728259) (← links)
- Characterizations of recognizable picture series (Q1022605) (← links)
- Two-dimensional codes (Q2106615) (← links)
- Characterization and measure of infinite two-dimensional strong prefix codes (Q2201795) (← links)
- Full sets of pictures to encode pictures (Q2422018) (← links)
- Weighted picture automata and weighted logics (Q2429722) (← links)
- Collage of two-dimensional words (Q2484446) (← links)
- New operations and regular expressions for two-dimensional languages over one-letter alphabet (Q2484449) (← links)
- Picture languages: tiling systems versus tile rewriting grammars. (Q2490811) (← links)
- A Nivat Theorem for Weighted Picture Automata and Weighted MSO Logic (Q2799219) (← links)
- Satisfiability via Smooth Pictures (Q2817998) (← links)
- Structure and properties of strong prefix codes of pictures (Q2971057) (← links)
- Picture codes (Q3423135) (← links)
