On the analysis and synthesis problems for context-free expressions

  • O. Mayer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 32)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. ARBIB, M.A and GIV'ON, Y. (1968): Algebra Automata I: Parallel Programming as a Prolegomena to a Categorical Approach, IC 12, 331–345.Google Scholar
  2. DONER, J. (1970): Tree Acceptors and Some of Their Applications, JCSS 4, 406–451.Google Scholar
  3. GRUSKA, J. (1971): A Characterization of Context-Free Languages, JCSS 5, 353–364.Google Scholar
  4. KLEENE, S.C. (1956): Representation of events in nerve sets, in "Automata Studies", pp. 3–40, Princeton Univ. Press.Google Scholar
  5. MAGIDOR, M. and MORAN, G. (1969): Finite Automata over Finite Trees, Hebrew Univ. Jerusalem, Techn. Rep. No. 30Google Scholar
  6. McWHIRTER, I.P. (1971): Substitution Expressions, JCSS 5, 629–637.Google Scholar
  7. THATCHER, J.W. (1967): Characterizing derivation trees of context-free grammars through a generalization of finite automata theory, JCSS 1, 317–322.Google Scholar
  8. THATCHER, J.W. and WRIGHT, J.B. (1969): Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic, MST 2, 57–81.Google Scholar
  9. YNTEMA, M,K, (1971): Cap Expressions for Context-Free Languages, IC 18, 311–318Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • O. Mayer
    • 1
  1. 1.Department of Computer ScienceUniversity of KaiserslauternGermany

Personalised recommendations