( en | de | ru )

 

Disambiguation of "Giammarresi, Dora"

Author of the publication

copydeleteadd this publication to your clipboard
Deterministic and unambiguous families within recognizable two-dimensional languages

, , and . Fundamenta Informaticae, 98 (2): 143--166 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Angela Dorau

Valeria Maria Dora

Darjusch Dorafschan

Said Dora

Monique Dorang

 

Other publications of authors with the same name

Finite State Recognizability for Two-Dimensional Languages: A Brief Survey.. Developments in Language Theory, page 299-308. World Scientific, Singapore, (1995)Thompson Languages., , and . Jewels are Forever, page 16-24. Springer, (1999)Finite Automata and Non-self-Embedding Grammars., , and . CIAA, volume 2608 of Lecture Notes in Computer Science, page 47-56. Springer, (2002)Avoiding Overlaps in Pictures., , and . DCFS, volume 10316 of Lecture Notes in Computer Science, page 16-32. Springer, (2017)From Determinism to Non-determinism in Recognizable Two-Dimensional Languages., , and . Developments in Language Theory, volume 4588 of Lecture Notes in Computer Science, page 36-47. Springer, (2007)Computing Languages by (Bounded) Local Sets.. Developments in Language Theory, volume 2710 of Lecture Notes in Computer Science, page 304-315. Springer, (2003)New operations and regular expressions for two-dimensional languages over one-letter alphabet, , and . Theoretical Computer Science, 340 (2): 408 - 431 (2005)The Art of Theory <xocs:full-name>The Art of Theory</xocs:full-name>.Characterization of Isometric Words based on Swap and Mismatch Distance., , , , , and . CoRR, (2024)A characterization of Thompson digraphs., , , and . Discret. Appl. Math., 134 (1-3): 317-337 (2004)A computational model for tiling recognizable two-dimensional languages, , and . Theoretical Computer Science, 410 (37): 3520--3529 (2009)