Classes of two-dimensional languages  and recognizability conditions

Marcella Anselmo; Maria Madonia

Displaying similar documents to “Classes of two-dimensional languages and recognizability conditions”

C++ Tools to construct our user-level language

Frédéric Hecht (2010)

ESAIM: Mathematical Modelling and Numerical Analysis

Similarity:

The aim of this paper is to present how to make a dedicaded computed language polymorphic and multi type, in to solve partial differential equations with the finite element method. The driving idea is to make the language as close as possible to the mathematical notation.

Finite automata with generalized acceptance criteria.

Peichl, Timo, Vollmer, Heribert (2001)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Similarity:

Structural unambiguity of formal languages

Václav Fabian (1964)

Czechoslovak Mathematical Journal

Similarity:

Unambiguous recognizable two-dimensional languages

Marcella Anselmo, Dora Giammarresi, Maria Madonia, Antonio Restivo (2006)

RAIRO - Theoretical Informatics and Applications

Similarity:

We consider the family UREC of unambiguous recognizable two-dimensional languages. We prove that there are recognizable languages that are inherently ambiguous, that is UREC family is a proper subclass of REC family. The result is obtained by showing a necessary condition for unambiguous recognizable languages. Further UREC family coincides with the class of picture languages defined by unambiguous 2OTA and it strictly contains its deterministic counterpart. Some closure and non-closure...