RAIRO-Theor. Inf. Appl.
Volume 40, Number 2, April-June 2006Alberto Bertoni: Climbing summits
|Page(s)||277 - 293|
|Published online||20 July 2006|
Unambiguous recognizable two-dimensional languages
Dipartimento di Informatica ed Applicazioni,
Università di Salerno, 84081 Baronissi, (Salerno), Italy;
2 Dipartimento di Matematica, Università di Roma “Tor Vergata”, via Ricerca Scientifica, 00133 Roma, Italy; firstname.lastname@example.org
3 Dipartimento di Matematica e Informatica, Università di Catania, Viale Andrea Doria 6/a, 95125 Catania, Italy; email@example.com
4 Dipartimento di Matematica e Applicazioni, Università di Palermo, via Archirafi 34, 90123 Palermo, Italy; firstname.lastname@example.org
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 properties of UREC are presented. Finally we show that it is undecidable whether a given tiling system is unambiguous.
Mathematics Subject Classification: 68Q45 / 68Q10
Key words: Automata and formal languages / unambiguity / determinism / two-dimensional languages.
© EDP Sciences, 2006
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.