Advertisement

L Systems pp 292-301 | Cite as

Bounded parallelism and regular languages

Looking For A General Framework
Part of the Lecture Notes in Computer Science book series (LNCS, volume 15)

Keywords

Regular Language Exit Point Regular Sequence Rule Book Linear Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. (1).
    Ibarra, O. H., Simple matrix languages, Information and Control 17 (1970), 359–394.Google Scholar
  2. (2).
    Wood, D., Properties of n-parallel finite state languages, Utilitas Mathematica 4 (1973), 103–113.Google Scholar
  3. (3).
    see footnote 1.Google Scholar
  4. (4).
    Wood, D., Two variations on n-parallel finite state generators, McMaster University CS TR 73/3 (1973).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • D. Wood
    • 1
  1. 1.Department of Applied MathematicsMcMaster UniversityUSA

Personalised recommendations