Advertisement

Two way finite state generators

  • Karel CulikII
  • Emmerich Welzl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)

Keywords

Regular Language Finite Automaton Regularity Problem Great Index Valid Computation 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [MRW]
    H. Maurer, G. Rozenberg and E. Welzl, “Chain code picture languages”, to appear in Lecture Notes in Computer Science.Google Scholar
  2. [H]
    M.A. Harrison, Introduction to Formal Language Theory, Addison Wesley (1978).Google Scholar
  3. [N]
    A. Nerode, “Linear automation transformations”, Proceedings of the American Mathematical Society 9 (1958) 541–544.Google Scholar
  4. [S]
    J. Sheperdson, “The reductions of two-way automata to one-way automata”, IBM Journal of Research and Development 3 (1959) 198–200.Google Scholar
  5. [W]
    E. Welzl, “Regular picture languages: Optimality and OI-interpretations”, in preparation.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Karel CulikII
    • 1
  • Emmerich Welzl
    • 2
  1. 1.Department of Computer ScienceUniversity of WaterlooWaterlooCanada
  2. 2.Institutes for Information Processing, IIGTechnical University of Graz and Austrian Computer SocietyGrazAustria

Personalised recommendations