Maria Madonia

Theor. Comput. Sci., 2017

Non-expandable non-overlapping sets of pictures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Structure and properties of strong prefix codes of pictures.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

Picture codes and deciphering delay.

[BibT_eX]

[DOI]

Inf. Comput., 2017

Avoiding Overlaps in Pictures.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2017

Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties.

[BibT_eX]

[DOI]

Proceedings of the Cellular Automata and Discrete Complex Systems, 2017

2016

Construction of Non-expandable Non-overlapping Sets of Pictures.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Structure and Measure of a Decidable Class of Two-dimensional Codes.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2015

Unbordered Pictures: Properties and Construction.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014

Prefix Picture codes: a Decidable class of Two-Dimensional codes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Picture Codes with Finite Deciphering Delay.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2014

2013

A Stronger Recognizability Condition for Two-dimensional Languages.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

Two-Dimensional Rational Automata: A Bridge Unifying One- and Two-Dimensional Language Theory.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

Two Dimensional Prefix Codes of Pictures.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

Strong Prefix Codes of Pictures.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 5th International Conference, 2013

2011

Reducibility and Solvability of Some Classes of Kryuchkov Binary Tree Pairs.

[BibT_eX]

[DOI]

Giuseppe Scollo

Electron. J. Comb., 2011

Some results on the structure of unary unambiguous automata.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2011

Classification of String Languages via Tiling Recognizable Picture Languages.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

Comparing Necessary Conditions for Recognizability of Two-Dimensional Languages.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 4th International Conference, 2011

2010

Classes of two-dimensional languages and recognizability conditions.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2010

Deterministic and Unambiguous Families within Recognizable Two-dimensional Languages.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

2009

Deterministic and unambiguous two-dimensional languages over one-letter alphabet.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A computational model for tiling recognizable two-dimensional languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Framed Versus Unframed Two-Dimensional Languages.

[BibT_eX]

[DOI]

Natasha Jonoska

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

A Note on Unambiguity, Finite Ambiguity and Complementation in Recognizable Two-Dimensional Languages.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Third International Conference, 2009

2007

Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2007

From Determinism to Non-determinism in Recognizable Two-Dimensional Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Deterministic Two-Dimensional Languages over One-Letter Alphabet.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006

Unambiguous recognizable two-dimensional languages.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

2005

New operations and regular expressions for two-dimensional languages over one-letter alphabet.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A Language-Theoretic Approach to Covering Problems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

Simulating Two-Dimensional Recognizability by Pushdown and Queue Automata .

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2005

2004

Regular Expressions for Two-Dimensional Languages Over One-Letter Alphabet.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 2004

2003

Covering Problems from a Formal Language Point of View.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 7th International Conference, 2003

1999

Covering Submonoids and Covering Codes.

[BibT_eX]

[DOI]

Sergio Salemi

Tecla Sportelli

J. Autom. Lang. Comb., 1999

1997

Some Decisional Problems on Rational Relations.

[BibT_eX]

[DOI]

Stefano Varricchio

Theor. Comput. Sci., 1997

1996

Iterative Pairs and Multitape Automata.

[BibT_eX]

[DOI]

Stefano Varricchio

Proceedings of the Trees in Algebra and Programming, 1996

1993

A Generalization of Sardinas and Patterson's Algorithm to Z-Codes.

[BibT_eX]

[DOI]

Sergio Salemi

Tecla Sportelli

Theor. Comput. Sci., 1993

1991

On z-submonoids and z-codes.

[BibT_eX]

[DOI]