Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T20:13:23.607Z Has data issue: false hasContentIssue false

Classes of two-dimensional languagesand recognizability conditions

Published online by Cambridge University Press:  28 February 2011

Marcella Anselmo
Affiliation:
Dipartimento di Informatica ed Applicazioni, Università di Salerno, 84084 Fisciano (SA), Italy; anselmo@dia.unisa.it
Maria Madonia
Affiliation:
Dipartimento di Matematica e Informatica, Università di Catania, Viale Andrea Doria 6/a, 95125 Catania, Italy; madonia@dmi.unict.it
Get access

Abstract

The paper deals with some classes of two-dimensional recognizablelanguages of “high complexity”,in a sense specified in the paper and motivated by some necessary conditions holding for recognizable andunambiguous languages. For such classes we can solve someopen questions related to unambiguity, finite ambiguityand complementation. Then we reformulate a necessary condition for recognizability stated by Matz, introducing a new complexity function.We solve an open question proposed by Matz, showing that all the known necessary conditions for recognizability of a language and its complement arenot sufficient. The proof relies on a family of languages defined by functions.

Information

Type
Research Article
Copyright
© EDP Sciences, 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable