Skip to Main content Skip to Navigation
New interface
Reports (Research report)

Simulations for a Class of Two-Dimensional Automata

Gérard Cécé 1 Alain Giorgetti 1, 2, 2, * 
* Corresponding author
2 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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 an 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 in a given 2OTA of a unique maximal autosimulation relation, computable in polynomial time.
Document type :
Reports (Research report)
Complete list of metadata

Cited literature [15 references]  Display  Hide  Download
Contributor : Alain Giorgetti Connect in order to contact the contributor
Submitted on : Friday, November 23, 2012 - 1:34:10 PM
Last modification on : Wednesday, October 26, 2022 - 8:16:38 AM
Long-term archiving on: : Sunday, February 24, 2013 - 3:50:56 AM


Files produced by the author(s)


  • HAL Id : inria-00527077, version 3


Gérard Cécé, Alain Giorgetti. Simulations for a Class of Two-Dimensional Automata. [Research Report] RR-7425, INRIA. 2010, pp.18. ⟨inria-00527077v3⟩



Record views


Files downloads