Ambiguity and Complementation in Recognizable Two-dimensional Languages-Reference-Cited by-同舟云学术

Ambiguity and Complementation in Recognizable Two-dimensional Languages

Published: Issue: Volume: Page:5-20
ISSN:1571-5736
Container-title:Fifth Ifip International Conference On Theoretical Computer Science – Tcs 2008
language:
Short-container-title:

Author:

Giammarresi D.,Restivo A.

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-0-387-09680-3_1.pdf

Reference29 articles.

1. M. Anselmo, D. Giammarresi, M. Madonia. Tiling Automaton: A Computational Model for Recognizable Two-Dimensional Languages. Procs. CIAA07, LNCS 44783, 290-302, Springer Verlag, 2007.

2. M. Anselmo, D. Giammarresi, M. Madonia. From Determinism to Non-determinism in Recognizable Two-dimensional Languages.Procs. DLT07, LNCS 4588, 36-47, Springer Verlag, 2007.

3. M. Anselmo, D. Giammarresi, M. Madonia, A. Restivo. Unambiguous Recognizable two-dimensional languages. RAIRO - Inf. Theor. Appl. 40 (2006) 277-293

4. 4. M. Anselmo,M. Madonia Deterministic and Unambiguous Two-dimensional Languages over One-letter Alphabet.Theoretical Computer Science, to appear.

5. A. Bertoni, M. Goldwurm, V. Lonati. On the Complexity of Unary Tiling-Recognizable Picture Languages. Procs. STACS’07, LNCS 4393, 381-392, Springer Verlag, 2007.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Expressiveness and complexity of regular pure two-dimensional context-free languages;International Journal of Computer Mathematics;2013-08

2. On Some Classes of 2D Languages and Their Relations;Lecture Notes in Computer Science;2011

3. Classes of two-dimensional languages and recognizability conditions;RAIRO - Theoretical Informatics and Applications;2010-10