Dags and Chomsky hierarchy

Extended abstract
  • Tsutomu Kamimura
  • Giora Slutzki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 71)


Directed Acyclic Graph Derivation Tree Tree Automaton Tree Language Tree Transducer 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [1]
    Arbib, M. A. and Give'on, Y. — Algebra Automata I: Parallel Programming as a Prelogomena to the Categorical Approach; Information and Control 12 (1968), 331–345.Google Scholar
  2. [2]
    Buttelmann, H. W. — On the Syntactic Structure of Unrestricted Grammars, I and II; Information and Control 29(1975), 29–101.Google Scholar
  3. [3]
    Eickel, J. and Loeckx, J. — The Relation Between Derivations and Syntactical Structures in Phrase-Structure Grammars; JCSS 6(1972), 267–282.Google Scholar
  4. [4]
    Engelfriet, J. — Tree Automata and Tree Grammars; Lecture Notes DAIMI, FN-10, University of Aarhus, Denmark, 1975.Google Scholar
  5. [5]
    Ginsburg, S. and Greibach, S. A. — Mappings Which Preserve Context-Sensitive Languages; Information and Control 9(1966), 563–582.Google Scholar
  6. [6]
    Hart, J. M. — Acceptors for the Derivation Language of Phrase-Structure Grammars; Information and Control 25(1974), 75–92.Google Scholar
  7. [7]
    Kamimura, T. and Slutzki, G. — Parallel and Two-way Recognizers of Directed Acyclic Graphs; to appear in MFCS '79, Olomouc, Czechoslovakia.Google Scholar
  8. [8]
    Kamimura, T. and Slutzki, G. — Dag Transductions, in preparation.Google Scholar
  9. [9]
    Loeckx, J. — The Parsing of General Phrase-Structure Grammar; Information and Control 16(1970), 443–464.Google Scholar
  10. [10]
    Ogden, W. F. and Rounds, W. C. — Compositions of n Tree Transducers; Proc. of 4th Annual ACM STOC, Denver, Colorado, 1972, 198–206.Google Scholar
  11. [11]
    Rounds, W. C. — Tree-oriented Proofs of some Theorems on Context-free and Indexed Languages; Proc. of 2nd Annual ACM STOC, Northampton, Mass., 1970, 109–116.Google Scholar
  12. [12]
    Thatcher, J. — Characterizing Derivation Trees of Context-Free Grammar through a Generalization of Finite Automata Theory; JCSS 1(1967), 317–322.Google Scholar
  13. [13]
    Wilson, R. — Introduction to Graph Theory; Oliver and Boyd, Edinburgh, 1972.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Tsutomu Kamimura
    • 1
  • Giora Slutzki
    • 1
  1. 1.University of DelawareNewarkUSA

Personalised recommendations