The following pages link to Marcella Anselmo (Q346243):
Displayed 50 items.
- Non-expandable non-overlapping sets of pictures (Q346246) (← links)
- Picture codes and deciphering delay (Q515672) (← links)
- Some results on the structure of unary unambiguous automata (Q544137) (← links)
- The operation \(\uparrow\) on formal power series (Q688677) (← links)
- Two-dimensional comma-free and cylindric codes (Q728259) (← links)
- The zig-zag power series: A two-way version of the \({}^*\) operator. (Q753497) (← links)
- A computational model for tiling recognizable two-dimensional languages (Q840773) (← links)
- Sur les codes zigzag et leur décidabilité. (Zigzag codes and their decidability) (Q914396) (← links)
- Deterministic and unambiguous two-dimensional languages over one-letter alphabet (Q1013124) (← links)
- On some factorization problems (Q1280223) (← links)
- On 2PFA's and the Hadamard quotient of formal power series (Q1326950) (← links)
- Infinite two-dimensional strong prefix codes: characterization and properties (Q1704099) (← links)
- A non-ambiguous decomposition of regular languages and factorizing codes (Q1861571) (← links)
- Bad pictures: some structural properties related to overlaps (Q2040404) (← links)
- On \(k\)-ary \(n\)-cubes and isometric words (Q2089690) (← links)
- Quaternary \(n\)-cubes and isometric words (Q2140457) (← links)
- Characterization and measure of infinite two-dimensional strong prefix codes (Q2201795) (← links)
- Toroidal codes and conjugate pictures (Q2278284) (← 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)
- (Q2708959) (← links)
- Structure and Measure of a Decidable Class of Two-dimensional Codes (Q2799183) (← links)
- Strong Prefix Codes of Pictures (Q2850002) (← 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)
- Classification of String Languages via Tiling Recognizable Picture Languages (Q3004570) (← links)
- Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages (Q3014932) (← links)
- (Q3370005) (← links)
- Unambiguous recognizable two-dimensional languages (Q3431439) (← links)
- Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages (Q3503914) (← links)
- Deterministic Two-Dimensional Languages over One-Letter Alphabet (Q3522864) (← links)
- Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages (Q3560552) (← links)
- Framed Versus Unframed Two-Dimensional Languages (Q3599066) (← links)
- A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages (Q3642529) (← links)
- ON LANGUAGES FACTORIZING THE FREE MONOID (Q3837509) (← links)
- Automates et codes zigzag (Q3970363) (← links)
- (Q3979262) (← links)
- (Q4038683) (← links)
- (Q4418597) (← links)
- (Q4448366) (← links)
- (Q4452056) (← 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)
- (Q5387718) (← links)