The following pages link to Dora Giammarresi (Q346244):
Displaying 50 items.
- (Q236670) (redirect page) (← links)
- Non-expandable non-overlapping sets of pictures (Q346246) (← links)
- Picture codes and deciphering delay (Q515672) (← links)
- A computational model for tiling recognizable two-dimensional languages (Q840773) (← links)
- Periodicities on trees (Q1275075) (← links)
- Deterministic generalized automata (Q1285583) (← links)
- A characterization of Thompson digraphs. (Q1421476) (← links)
- Infinite two-dimensional strong prefix codes: characterization and properties (Q1704099) (← links)
- Monadic second-order logic over rectangular pictures and recognizability by tiling systems (Q1917078) (← links)
- Decremental 2- and 3-connectivity on planar graphs (Q1924402) (← links)
- Bad pictures: some structural properties related to overlaps (Q2040404) (← links)
- Two-dimensional models (Q2074211) (← links)
- Characterization and measure of infinite two-dimensional strong prefix codes (Q2201795) (← links)
- Avoiding overlaps in pictures (Q2400986) (← links)
- Full sets of pictures to encode pictures (Q2422018) (← links)
- New operations and regular expressions for two-dimensional languages over one-letter alphabet (Q2484449) (← links)
- Structure and Measure of a Decidable Class of Two-dimensional Codes (Q2799183) (← links)
- Strong Prefix Codes of Pictures (Q2850002) (← 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)
- Classification of String Languages via Tiling Recognizable Picture Languages (Q3004570) (← links)
- (Q3086926) (← links)
- Unambiguous recognizable two-dimensional languages (Q3431439) (← links)
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages (Q3503914) (← links)
- Tiling Recognizable Two-Dimensional Languages (Q3522860) (← links)
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages (Q3560552) (← links)
- A Brief Excursion Inside the Class of Tiling Recognizable Two-Dimensional Languages (Q3584878) (← links)
- (Q4227127) (← links)
- (Q4418597) (← links)
- (Q4448365) (← links)
- (Q4452071) (← links)
- (Q4474153) (← links)
- Deterministic generalized automata (Q4596633) (← links)
- (Q4874662) (← links)
- (Q4941144) (← links)
- (Q4942615) (← links)
- (Q4955249) (← links)
- Dynamic 2- and 3-connectivity on planar graphs (Q5056143) (← links)
- A Common Framework to Recognize Two-dimensional Languages* (Q5114207) (← links)
- Encoding Pictures with Maximal Codes of Pictures (Q5127197) (← links)
- Sets of Pictures Avoiding Overlaps (Q5205035) (← links)
- PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES (Q5247172) (← links)
- Two Dimensional Prefix Codes of Pictures (Q5300828) (← links)
- Picture Codes with Finite Deciphering Delay (Q5404903) (← links)
- From Determinism to Non-determinism in Recognizable Two-Dimensional Languages (Q5428218) (← links)
- (Q5485980) (← links)
- Developments in Language Theory (Q5711977) (← links)
- Normal form algorithms for extended context-free grammars (Q5958723) (← links)