Simulations over Two-Dimensional On-Line Tessellation Automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Simulations over Two-Dimensional On-Line Tessellation Automata

Abstract

We study the notion of simulation over a class of automata which recognize 2D languages (languages of arrays of letters). This class of two-dimensional On-line Tessellation Automata (2OTA) accepts the same class of languages as the class of tiling systems, considered as the natural extension of classical regular word languages to the 2D case. We prove that simulation over 2OTA implies language inclusion. Even if the existence of a simulation relation between two 2OTA is shown to be a NP-complete problem in time, this is an important result since the inclusion problem is undecidable in general in this class of languages. Then we prove the existence of a unique maximal autosimulation relation in a given 2OTA and the existence of a unique minimal 2OTA which is simulation equivalent to this given 2OTA, both computable in polynomial time.

Dates and versions

hal-00642531 , version 1 (18-11-2011)

Identifiers

Cite

Gérard Cécé, Alain Giorgetti. Simulations over Two-Dimensional On-Line Tessellation Automata. 15th International Conference on Developments in Language Theory - DLT 2011, Jul 2011, Milan, Italy. pp.141--152, ⟨10.1007/978-3-642-22321-1_13⟩. ⟨hal-00642531⟩
211 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More