Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 1984: Mathematical Foundations of Computer Science 1984 pp 32–49Cite as

Systolic automata — power, characterizations, nonhomogeneity

  • Invited Lectures
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 176))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Černý, A.: Personal communication, 1984.

    Google Scholar 

  2. Černý, A. — Gruska, J.: Modular trellis automata (in preparation), 1984.

    Google Scholar 

  3. Cole, S.N.: Real-time computation by n-dimensional iterative arrays of finite-state machines, IEEE Trans. on Comp., V18, 1969, 349–365.

    Google Scholar 

  4. Choffrut, C.—Culik, K.II.: On real-time cellular automata and trellis automata, Res. Rep. F114, Inst. für Informationsverarbeitung, TU Graz, 1983.

    Google Scholar 

  5. Culik, K.II.— Bucher, W.: On real-time and linear time cellular automata, Res. Rep. F115, Inst. für Informationsverarbeitung, TU Graz, 1983.

    Google Scholar 

  6. Culik, K.II. — Gruska, J. — Salomaa, A.: Systolic trellis automata (for VLSI), Res. Rep. CS-81-34, Dept. of Comp. Sci., University of Waterloo, 1981.

    Google Scholar 

  7. Culik, K.II. — Gruska, J. — Salomaa, A.:Systolic trellis automata: stability, decidability and complexity, Res. Rep. CS-82-04,Dept. of Comp. Sci., University of Waterloo, 1982.

    Google Scholar 

  8. Culik, K.II. — Gruska, J. — Salomaa, A.: Systolic automata for VLSI on balanced trees, Acta Informatica 18, 1983, 335–344.

    Google Scholar 

  9. Culik, K.II. — Gruska, J. — Salomaa, A.: On a family of L languages resulting from systolic tree automata, TCS 23, 1983, 231–242.

    Google Scholar 

  10. Culik, K.II. — Jürgensen, H.: Programmable finite automata for VLSI, Intern. J. Computer Math., V14, 1983, 259–275.

    Google Scholar 

  11. Culik, K.II. — Pachl, J.: Folding and unrolling systolic arrays, Proc. ACM SIGACT — SIGOPS Symp. on Principles of Distributed Computing, 1982, 254–261.

    Google Scholar 

  12. Culik, K.II. — Salomaa, A. — Wood, D.: VLSI systolic trees as acceptors, RAIRO, Theoretical Informatics, 1984,to appear.

    Google Scholar 

  13. Culik,K.II. — Yu, S.: Iterative tree automata, Res. Rep. CS-84-03, Dept. of Comp. Sci., University of Waterloo, 1984.

    Google Scholar 

  14. Dohl, Y. — Fischer, A.L. — Kung, H.T. — Monier, L.M.: The programmable systolic chip: project overview, Proc. Workshop on Algorithmically Specialized Computer Organisations, Purdue Univ., Sept. 1982.

    Google Scholar 

  15. Gruska, J.: Simulation of systolic tree automata by systolic trellis automata, (in preparation) 1984.

    Google Scholar 

  16. Hennie, F.C.: Iterative arrays of logical circuits, MIT Press, 1961.

    Google Scholar 

  17. Hromkovič, J.: Personal communication, 1984.

    Google Scholar 

  18. Ibarra, O. — Kim, S.: Characterizations and computational complexity of systolic trellis automata, TCS, V29, N1,2, 1984.

    Google Scholar 

  19. Ibarra, O. — Kim, S.: A characterization of systolic binary tree automata and applications, to appear in Acta Informatik, 1984.

    Google Scholar 

  20. Ibarra, O. — Kim, S.: Characterizations of linear iterative arrays, Res. Rep., Dept. of Comp. Sci., University of Minnesoty, 1983.

    Google Scholar 

  21. Ibarry, O. — Kim, S. — Moran, S.: Trellis automata: characterizations, speed-up, hierarchy, decision problems, Res. Rep.,Dept. of Comp. Sci., University of Minnesota, 1983.

    Google Scholar 

  22. Jürgensen, H. — Salomaa, A.: Syntactic monoids in the construction of systolic tree automata, TI-5/83, Inst. für Theoretische Informatik, Tech. Hochschule Darmstadt, 1983.

    Google Scholar 

  23. Korec, I.: Generalized Pascal triangles: decidability results, to appear in Acta Math., Univ. Comen, Bratislava, 1985.

    Google Scholar 

  24. Korec, I.: Two kinds of processors are sufficient and large operating alphabets are necessary for regular trellis automata languages,Bulletin EATCS, 1984.

    Google Scholar 

  25. Korec, I.: Personal communications, 1984.

    Google Scholar 

  26. Kung, H.T.: Why systolic architecture, Computer Magazine, 1982, 37–46.

    Google Scholar 

  27. Kung, H.T. — Leiserson, C.E.: Systolic arrays (for VLSI), Sparse Matrix Proc. 1978, Society f. Industrial and Applied Mathematics, 1979, 256–282.

    Google Scholar 

  28. Lewis, H.R. — Papadimitriou, C.H.: Elements of the theory of computation, Prentice-Hall, 1981.

    Google Scholar 

  29. Patterson, M.: Solution to P8, EATCS Bulletin, 18, 1982.

    Google Scholar 

  30. Salomaa, A.: Systolic tree and trellis automata, Proc.Colloq ACLCS, Györ, 1984.

    Google Scholar 

  31. Salomaa, A. — Soittola, M.: Automata — theoretic aspects of formal power series, Springer-Verlag, Berlin, 1978.

    Google Scholar 

  32. Steinby, M.: Systolic trees and systolic language recognition by tree automata, TCS, V22, 1983, 219–232.

    Google Scholar 

  33. Wiedermann, J.: Parallel Turing machines and systolic computations, Res. Rep., VUSAI-AR Bratislava. 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. VUSEI-AR, Dubravská 3, 84221, Bratislava, Czechoslovakia

    Jozef Gruska

Authors
  1. Jozef Gruska
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. P. Chytil V. Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gruska, J. (1984). Systolic automata — power, characterizations, nonhomogeneity. In: Chytil, M.P., Koubek, V. (eds) Mathematical Foundations of Computer Science 1984. MFCS 1984. Lecture Notes in Computer Science, vol 176. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030288

Download citation

  • DOI: https://doi.org/10.1007/BFb0030288

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13372-8

  • Online ISBN: 978-3-540-38929-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation