A note on Lindenmayer systems, Szilard languages, spectra, and equivalence

  • Derick Wood
Article

DOI: 10.1007/BF00976218

Cite this article as:
Wood, D. International Journal of Computer and Information Sciences (1975) 4: 53. doi:10.1007/BF00976218

Abstract

We investigate the Szilard languages and the spectra of Lindenmayer systems through the generalization of Lindenmayer systems toK-iteration grammars and context-sensitiveK-iteration grammars. Various decidability and undecidability results are presented with respect to the evaluation of Szilard languages and spectra for particularK-iteration grammars. Further, two different definitions of the Szilard and spectral equivalence of twoK-iteration grammars are investigated.

Key words

Lindenmayer systems Szilard languages K-iteration grammars regular languages language equivalence problems 

Copyright information

© Plenum Publishing Corporation 1975

Authors and Affiliations

  • Derick Wood
    • 1
  1. 1.Computer Science Group, Department of Applied MathematicsMcMaster UniversityHamiltonCanada