Skip to main content
SpringerLink
Log in

Dags and Chomsky hierarchy

Extended abstract

  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1979)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 71))

Included in the following conference series:

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  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. Buttelmann, H. W. — On the Syntactic Structure of Unrestricted Grammars, I and II; Information and Control 29(1975), 29–101.

    Google Scholar 

  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. Engelfriet, J. — Tree Automata and Tree Grammars; Lecture Notes DAIMI, FN-10, University of Aarhus, Denmark, 1975.

    Google Scholar 

  5. Ginsburg, S. and Greibach, S. A. — Mappings Which Preserve Context-Sensitive Languages; Information and Control 9(1966), 563–582.

    Google Scholar 

  6. Hart, J. M. — Acceptors for the Derivation Language of Phrase-Structure Grammars; Information and Control 25(1974), 75–92.

    Google Scholar 

  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. Kamimura, T. and Slutzki, G. — Dag Transductions, in preparation.

    Google Scholar 

  9. Loeckx, J. — The Parsing of General Phrase-Structure Grammar; Information and Control 16(1970), 443–464.

    Google Scholar 

  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. 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. Thatcher, J. — Characterizing Derivation Trees of Context-Free Grammar through a Generalization of Finite Automata Theory; JCSS 1(1967), 317–322.

    Google Scholar 

  13. Wilson, R. — Introduction to Graph Theory; Oliver and Boyd, Edinburgh, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Delaware, 19711, Newark, DE, USA

    Tsutomu Kamimura & Giora Slutzki

Authors
  1. Tsutomu Kamimura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giora Slutzki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hermann A. Maurer

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamimura, T., Slutzki, G. (1979). Dags and Chomsky hierarchy. In: Maurer, H.A. (eds) Automata, Languages and Programming. ICALP 1979. Lecture Notes in Computer Science, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09510-1_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-09510-1_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09510-1

  • Online ISBN: 978-3-540-35168-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation