Skip to main content

Treating terminals as function values of time

  • Session 3 Theory
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1984)

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

Abstract

Motivated by the idea of describing parquet deformations using grammars, we define in this paper a terminal weighted grammar where the terminal generated at any step of a derivation is defined as a function of time. It is seen that terminal weighted regular grammars generate exactly the class of recursively enumerable sets. Terminal weighted matrix grammars are used to describe parquet deformations. The hierarchy of families generated by putting various restrictions on the functions is studied.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K.S.Fu, Syntactic Pattern Recognition and Applications, Prentice-Hall, 1982.

    Google Scholar 

  2. D.R.Hofstadter, Metamagical Themas: Parquet deformations: patterns of tiles that shift gradually in one dimension, Scientific American, No.1, Vol.249, July 1983.

    Google Scholar 

  3. D.R.Hofstadter, Godel, Esher and Bach: an eternal golden braid, Vintage Books, 1980.

    Google Scholar 

  4. J.E.Hopcroft and J.D.Ullman, Automata, Languages and Computation, Addison-Wesley, 1979.

    Google Scholar 

  5. N. Nirmal and K. Krithivasan, Table Matrix L Systems, International Journal of Computer Mathematics, 10, 1982, 247–255.

    Google Scholar 

  6. A.Rosenfeld, A note on Cycle Grammars, Computer Science Centre, University of Maryland, TR-300, April 1974.

    Google Scholar 

  7. A.Rosenfeld, Picture Languages, Academic Press, 1979.

    Google Scholar 

  8. A.Salomaa, Jewels of Formal Language Theory, Computer Science Press, 1981.

    Google Scholar 

  9. G. Siromoney, R. Siromoney and K. Krithivasan, Abstract families of matrices and picture languages, Computer Graphics Image Processing, 1, 1972, 284–307.

    Google Scholar 

  10. G. Siromoney, R. Siromoney and K. Krithivasan, Picture Languages with array rewriting rules, Inform. Contr. 22, 1973, 447–470.

    Google Scholar 

  11. G. Siromoney, R. Siromoney and K. Krithivasan, Array grammars and Kolam, Computer Graphics and Image Processing, 3,1974,63–82

    Google Scholar 

  12. G. Siromoney, and R. Siromoney, Radial grammars and radial L-Systems Computer Graphics Image Processing, 4, 1975, 361–374.

    Google Scholar 

  13. A.L. Shaw, A formal picture description scheme as a basis for picture processing systems, Inform. Control, 14, 1969, 9–52.

    Google Scholar 

  14. L. Wegner, Is wwwR cube-free, bulletin of the EATCS, 18, 1982,120.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mathai Joseph Rudrapatna Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Krithivasan, K., Das, A. (1984). Treating terminals as function values of time. In: Joseph, M., Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1984. Lecture Notes in Computer Science, vol 181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13883-8_73

Download citation

  • DOI: https://doi.org/10.1007/3-540-13883-8_73

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13883-9

  • Online ISBN: 978-3-540-39087-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics