Abstract
Modular trellises are infinite two-dimensional words which are limits of developmental sequences of a very natural two-dimensional generalization of PDOL-systems.
The original motivation to investigate modular trellises came from the area of systolic automata. Modular trellises represent there a class of very modular nonhomogeneous arrays of processors.
Modular trellises are also a natural generalization of the Cobham’s /Co 72/ construction of uniform tag sequences based on iterating uniform morphisms.
We first present here various properties of modular trellises and then we give various characterizations of them /in terms of sorting automata and in terms of fixpoints of morphisms and substitutions/. We discuss also the relation between modular and regular trellises /CGS 84/. Finally, decidability of various pattern occurrence problems is shown and decidability of the equivalence problem is discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Carlyle, J.W., Greibach., S., Paz, A.; A two-dimensional generating system modelling growth and binary cell division, Proc. 15th. Annual Symp. Switching Automata Theory, 1974, 1–12
Černý, A.: Modular trellis: automata, thesis, VUSEI-AR, Bratislava, 1984 /in Slovak/
Černý, A., Gruska, J.: Modular trellis automata, Fundamenta Informaticae, 1985 /to appear/
Cobham, A.: On the base dependence of sets of numbers recognizable by finite automata, Math. Systems Theory 3, 1969, 186–192
Cobham, A.: Uniform tag sequences, Math. Systems Theory, 6, 1972, 164–192
Culik II, K., Gruska, J., Salomaa, A.: Systolic trellis automata, Intern. J. Computer Math., 1984, V15, 195–212, V16, 3-22
Culik II, K., Gruska J., Salomaa, A.: Systolic trellis automata: stability, decidability and complexity, Res.Rep. CS-82-04, Univ. of Waterloo, 1982
Culik II, K., Lindenmayer, A.: Parallel graph generating and graph recurrence systems for multicellular development, Internat J. Gen. Systems 3, 1976, 53–66
Ibarra, O., Kim, S., Moran, S.: Trellis automata: Characterizations, speed—up, hierarchy, decision problems, Res. Rep., Univ. of Minnesota, 1983
Korec, I.: Generalized Pascal triangles. Decidability results. Acta Math. Univ. Comen., Bratislava, 1985 /to appear/
Lindenmayer, A., Rozenberg, G.: Parallel generation of maps: developmental systems for cell layers. In: Graph Grammars and their Application to Computer Science and Biology, edited by V. Claus et al: LNCS 73, 1979, 301–316
Salomaa, A.: Formal languages. Academic Press, New York, 1973
Thue, A.: Über die gegenseitige Lage Gleichen Teile gewisser Zeichenreihen, Videnskapsselskapets Skifter, I. Mat.-naturw. Klasse, Kristiania, 1912, N1, 1–67.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Černý, A., Gruska, J. (1986). Modular Trellises. In: The Book of L. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95486-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-95486-3_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-95488-7
Online ISBN: 978-3-642-95486-3
eBook Packages: Springer Book Archive