Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
References

Characterizations of Recognizable Picture Series

Profile image of Soni TeWeSoni TeWe
visibility

…

description

21 pages

link

1 file

Abstract

We investigate power series on pictures which map pictures to elements of a semiring and provide an extension of two-dimensional languages to a quantitative setting. We will assign weights to devices, ranging from tiling systems and domino systems to picture automata. We prove that, for commutative semirings, the behaviors of weighted picture automata are precisely alphabetic projections of series defined by rational operations and also coincide with the families of projections of tile-local and projections of hv-local series. Furthermore, we establish properties of unambiguous picture languages by characterizations in terms of unambiguous rational operations with injective projections and devices such as unambiguous (quadrapolic) picture automata or unambiguous domino systems.

Related papers

Pictures of functions and their acceptability by automata
Hiroakira Ono

Theoretical Computer Science, 1988

Pictures of functions of one variable in the natural number theory are introduced as patterns over (0, 1) in the first quadrant. It is proved that the set of pictures cf at1 computable functions of one variable is obtained as the bottom planes of three-dimensional arrays accepted by some nondeterministic automaton on "'-tapes. To our surprise, it is also ihnwn that a set of pictures of functions containing a noncomputable function is deterministically obtained in a similar way. Further, it is proved that the set of initial segments of pictures of all computable functions and/or the noncomputable function is accepted hy a deterministic TL -ing rectangular array acceptor.

View PDFchevron_right
On the Complexity of Unary Tiling-Recognizable Picture Languages
Violetta Lonati

Lecture Notes in Computer Science, 2007

We give a characterization, in terms of computational complexity, of the family Rec1 of the unary picture languages that are tiling recognizable. We introduce quasi-unary strings to represent unary pictures and we prove that any unary picture language L is in Rec1 if and only if the set of all quasi-unary strings encoding the elements of L is recognizable by a one-tape nondeterministic Turing machine that is space and head-reversal linearly bounded. In particular, the result implies that the family of binary string languages corresponding to tiling-recognizable square languages lies between NTime(2 n) and NTime(4 n). This also implies the existence of a nontiling-recognizable unary square language that corresponds to a binary string language recognizable in nondeterministic time O(4 n log n).

View PDFchevron_right
Rational and Recognisable Power Series
Jacques Sakarovitch

Monographs in Theoretical Computer Science, 2009

View PDFchevron_right
On recognizable and rational formal power series in partially commuting variables
Manfred Droste

Lecture Notes in Computer Science, 1997

We will describe the recognizable formal power series over arbitrary semirings and in partially commuting variables, i.e. over trace monoids. We prove that the recognizable series are certain rational power series, which can be constructed from the polynomials by using the operations sum, product and a restricted star which is applied only to series for which the elements in the support all have the same connected alphabet. The converse is true if the underlying semi-ring is commutative. Moreover, if in addition the semiring is idempotent then the same result holds with a star restricted to series for which the elements in the support have connected (possibly di erent) alphabets. It is shown that these assumptions over the semiring are necessary. This provides a joint generalization of Kleene's, Sch utzenberger's and Ochma nski's theorems.

View PDFchevron_right
Descriptive complexity for pictures languages
Frédéric Olive

This paper deals with logical characterizations of picture languages of any dimension by syntactical fragments of existential second-order logic. Two classical classes of picture languages are studied: the class of recognizable picture languages, i.e. projections of languages defined by local constraints (or tilings): it is known as the most robust class extending the class of regular languages to any dimension; the class of picture languages recognized on nondeterministic cellular automata in linear time: cellular automata are the simplest and most natural model of parallel computation and linear time is the minimal time-bounded class allowing synchronization of nondeterministic cellular automata. We uniformly generalize to any dimension the characterization by D. Giammarresi et al. [Inf. Comput. 125, No. 1, 32–45 (1996; Zbl 0853.68131)] of the class of recognizable picture languages in existential monadic second-order logic. We state several logical characterizations of the class ...

View PDFchevron_right
Semirings and Formal Power Series
Amek AK

2009

View PDFchevron_right
Descriptive complexity for pictures languages (extended abstract)
Etienne Grandjean

This paper deals with descriptive complexity of picture languages of any dimension by syntactical fragments of existential second-order logic. - We uniformly generalize to any dimension the characterization by Giammarresi et al. \cite{GRST96} of the class of \emph{recognizable} picture languages in existential monadic second-order logic. - We state several logical characterizations of the class of picture languages recognized in linear time on nondeterministic cellular automata of any dimension. They are the first machine-independent characterizations of complexity classes of cellular automata. Our characterizations are essentially deduced from normalization results we prove for first-order and existential second-order logics over pictures. They are obtained in a general and uniform framework that allows to extend them to other "regular" structures. Finally, we describe some hierarchy results that show the optimality of our logical characterizations and delineate their lim...

View PDFchevron_right
New models for recognition of picture languages: Sgraffito and restarting tiling automata
Daniel Prusa

We introduce two new models of two-dimensional computing devices called sgraffito automaton and restarting tiling automaton. The models fulfill two conditions. Firstly, they do not exceed the power of finite-state automata when working over one-dimensional inputs. And secondly, they allow a clear design of important computations. We study properties of the induced families of picture languages. We show that they include strictly REC and that restarting tiling automata are able to simulate sgraffito automata. An interesting family is settled by deterministic sgraffito automata. It can be seen as an alternative to DREC.

View PDFchevron_right
On transformations of formal power series
Manfred Droste

Information and Computation, 2003

Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state machines. In this paper, motivated by codings of formal languages, we introduce and investigate two types of transformations for formal power series. We characterize when these transformations preserve recognizability, generalizing the recent results of Zhang [16] to the formal power series setting. We show, for example, that the "square-root" operation, while preserving regularity for formal languages, preserves recognizability for formal power series when the underlying semiring is commutative or locally finite, but not in general.

View PDFchevron_right
Domino Recognizability of Triangular Picture Languages
Gnanaraj Thomas

International Journal of Computer Applications, 2012

The notion of local iso-triangular picture languages and recognizable iso-triangular picture languages are introduced. Domino recognizability of iso-triangular picture languages and HRL-domino systems are defined. Also the concept that recognizable iso-triangular picture languages are characterized as projections of hrl-local triangular picture languages is derived. Theorems are proved.

View PDFchevron_right

References (29)

  1. M. Anselmo, D. Giammarresi, M. Madonia, and A. Restivo. Unambiguous recognizable two- dimensional languages. 2006. submitted.
  2. J. Berstel and C. Reutenauer. Rational Series and Their Languages, volume 12. Springer, 1988.
  3. M. Blum and C. Hewitt. Automata on a 2-dimensional tape. In IEEE Symposium on Switching and Automata Theory, pages 155-160. 1967.
  4. S. Bozapalidis and A. Grammatikopoulou. Recognizable picture series. In Special issue on Weighted Automata, presented at WATA 2004, Dresden, Journal of Automata, Languages and Combinatorics. 2005. In print.
  5. C. Choffrut and B. Durak. Collage of two-dimensional words. Theor. Comput. Sci., 340(1):364-380, 2005.
  6. S. Crespi-Reghizzi and M. Pradella. Tile rewriting grammars and picture languages. Theor. Comput. Sci., 340(1):257-272, 2005.
  7. D. Dubois, E. Hüllermeier, and H. Prade. A systematic approach to the assessment of fuzzy associ- ation rules. Technical report, Philipps-Universität Marburg, 2004.
  8. S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, 1974.
  9. K. S. Fu. Syntactic Methods in Pattern Recognition. Academic Press, New York, 1974.
  10. D. Giammarresi and A. Restivo. Recognizable picture languages. In Special Issue on Parallel Image Processing. M. Nivat, A. Saoudi, and P.S.P. Wangs (Eds.), volume 6 of International Journal Pattern Recognition and Artificial Intelligence, pages 241-256. 1992.
  11. D. Giammarresi and A. Restivo. Two-dimensional finite state recognizability. Fundam. Inform., 25(3):399-422, 1996.
  12. D. Giammarresi and A. Restivo. Two-dimensional languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 215-267. Springer, Berlin, 1997.
  13. D. Giammarresi, A. Restivo, S. Seibert, and W. Thomas. Monadic second-order logic over rectan- gular pictures and recognizability by tiling systems. Inform. and Comput., 125:32-45, 1996.
  14. K. Inoue and A. Nakamura. Some properties of two-dimensional on-line tessellation acceptors. Information Sciences, 13:95-121, 1977.
  15. K. Inoue and I. Takanami. A survey of two-dimensional automata theory. Information Sciences, 55:99-121, 1991.
  16. C. Moore K. Lindgren and M. Nordahl. Complexity of two-dimensional patterns. pages 909-951.
  17. J. Kari and C. Moore. New results on alternating and non-deterministic two-dimensional finite-state automata. In STACS, pages 396-406, 2001.
  18. W. Kuich and A. Salomaa. Semirings, Automata, Languages, volume 5. Springer, 1986.
  19. M. Latteux and D. Simplot. Recognizable picture languages and domino tiling. Theoretical Computer Science, 178:275-283, 1997.
  20. O. Matz. Regular expressions and context-free grammars for picture languages. In STACS, pages 283-294, 1997.
  21. O. Matz. On piecewise testable, starfree, and recognizable picture languages. In P. van Emde Boas et al., editors, FoSSaCS, volume 1378 of Lecture Notes in Computer Science, pages 203-210. Springer-Verlag, Berlin, 1998.
  22. I. Mäurer. Recognizable and rational picture series. In Conference on Algebraic Informatics, pages 141-155. Aristotle University of Thessaloniki Press, 2005.
  23. I. Mäurer. Weighted picture automata and weighted logics. In B. Durand and W. Thomas, editors, STACS 2006, volume 3885 of Lecture Notes in Computer Science, pages 313-324. Springer Berlin, 2006.
  24. M. Minski and S. Papert. Perceptron. M.I.T. Press, Cambridge, Mass., 1969.
  25. A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, 1978.
  26. M.P. Schützenberger. On the definition of a family of automata. Information and Control, 4:245-270, 1961.
  27. D. Simplot. A characterization of recognizable picture languages by tilings by finite sets. Theor. Comput. Sci., 218(2):297-323, 1999.
  28. R.A. Smith. Two-dimensional formal languages and pattern recognition by cellular automata. 12th IEEE FOCS Conference Record, pages 144-152, 1971.
  29. T. Wilke. Star-free picture expressions are strictly weaker than first-order logic. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccamela, editors, ICALP'97 Proceedings, volume 1256 of Lecture Notes in Computer Science, pages 347-357. Springer-Verlag, Berlin, 1997.

Related papers

Recognizable Picture Series
Archontia Grammatikopoulou

2005

We introduce quadrapolic automata whose behaviors are the recognizable picture languages. The quadrapolic automata weighted over a semiring compute picture series which have nice properties. The eastern faces of such series form a class of word series having properties similar to those of context-sensitive word languages.

View PDFchevron_right
On a class of rational functions for pictures
Daniel Prusa

2015

View PDFchevron_right
Recognizable picture languages and domino tiling
Michel Latteux

Theoretical Computer Science, 1997

In [2], Giammarresi and Restivo define the notion of local picture languages by giving a set of authorized 2 x 2 tiles over C U {#} where # is a boundary symbol which surrounds the pictures. Then they define the class of recognizable picture languages as the set of languages which can be obtained by projection of a local one. This class is of interest since it admits several quite different characterizations . Here, we define the hv-local picture languages where 2 x 2 tiles are replaced by horizontal and vertical dominoes. So the horizontal and the vertical scanning can be done separately. However, we prove that every recognizable picture language can be obtained as a projection of a hv-local language.

View PDFchevron_right
Some classes of rational functions for pictures
Daniel Prusa

RAIRO - Theoretical Informatics and Applications, 2016

With the aid of homogeneous morphisms, we turn the deterministic two-dimensional two-way ordered restarting automaton and its extended variant into devices that compute transductions of pictures, and we study the resulting classes of transductions in detail.

View PDFchevron_right
The Complexity of Unary Tiling Recognizable Picture Languages: Nondeterministic and Unambiguous Cases
Violetta Lonati

Fundamenta Informaticae

In this paper we consider the classes REC 1 and UREC 1 of unary picture languages that are tiling recognizable and unambiguously tiling recognizable, respectively. By representing unary pictures by quasi-unary strings we characterize REC 1 (resp. UREC 1) as the class of quasi-unary languages recognized by nondeterministic (resp. unambiguous) linearly space-bounded one-tape Turing machines with constraint on the number of head reversals. We apply such a characterization in two directions. First we prove that the binary string languages encoding tiling recognizable unary square languages lies between NTIME(2 n) and NTIME(4 n); by separation results, this implies there exists a non-tiling recognizable unary square language whose binary representation is a language in NTIME(4 n log n). In the other direction, by means of results on picture languages, we are able to compare the power of deterministic, unambiguous and nondeterministic one-tape Turing machines that are linearly space-bounded and have constraint on the number of head reversals.

View PDFchevron_right
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved