Skip to main content
SpringerLink
Log in
Book cover

International Conference on Fundamentals of Computation Theory

FCT 1985: Fundamentals of Computation Theory pp 371–379Cite as

About two-way transducers

  • Conference paper
  • First Online:

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

Abstract

We considerer the families of languages produced by two-way transducers, and prove iteration lemmas for them. Thus it is shown that the Dyck language D′ *1 doesn't belong to the deterministic family, and consequently that the Dyck language D′ *2 doesn't belong to the non-deterministic one. Therefore the Dyck language D′ *1 is not an EDTOL language.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. J. BEAUQUIER Deux familles de langages incomparables. Inform and control 43-2, 101–121 (1979)

    Google Scholar 

  2. J. BERSTEL Transductions and context-free languages. Teubner Studien Bücher — Stuttgart 1979.

    Google Scholar 

  3. J. BERSTEL C. REUTENAUER Les séries rationnelles et leurs languages. Masson (1984)

    Google Scholar 

  4. B. BRAINERD An analog of a theorem on context-free languages. Inform and control 11, 561–567 (1968)

    Google Scholar 

  5. A. EHRENFEUCHT G. ROZENBERG On some context-free languages that are not deterministic ETOL languages. RAIRO — Info. theorique. Vol. 11,4,1977, 273–291.

    Google Scholar 

  6. EHRICH & YAU Two-way sequential transduction and stacks automata. Inform and control 18, 404–446 (1971)

    Google Scholar 

  7. J. ENGELFRIET Two-way automata and checking automata. Math-Centrum-Amsterdam (1981)

    Google Scholar 

  8. M.A. HARRISON Introduction to formal language theory (Addison Wesley)

    Google Scholar 

  9. D. FERMENT Principality results about some matrix language families.Lecture note in computer science 172-ICALP July 1984.

    Google Scholar 

  10. S. GREIBACH (1) Syntactic operators on full semi-AFLS J.C.S.S. 6, 30–76 (1972), 30–76

    Google Scholar 

  11. (2) Remarks on blind and partially blind one-way multicounter machines. Th. Comp. Sc. 7 (1978), 311–324.

    Google Scholar 

  12. (3) One way finite visit automata. T.C.S.6 (1978) 175–221.

    Google Scholar 

  13. M. LATTEUX (1) Substitutions dans 1es EDTOL Inform and control 42, no2, (1979)

    Google Scholar 

  14. (2) Sur les génerateurs algébriques ultralinéaires. Acta Informatica 13, 347–363 (1980)

    Google Scholar 

  15. (3) Langages à un compteur. J.C.S.S. vol 26 no1. February 1983.

    Google Scholar 

  16. M. LOTHAIRE Combinatorics on words. Addison-Wesley Publ. Comp. (1983)

    Google Scholar 

  17. G. PAUN (1) On the index of grammars and languages. Inform and control 35, 259–266 (1977).

    Google Scholar 

  18. (2) Some consequence of a result of Ehrenfeucht and Rozenberg. RAIRO 14, no1, 119–122, (1980).

    Google Scholar 

  19. J. PECUCHET Automates boustrophédons — ICALP — July 1984.

    Google Scholar 

  20. V. RAJLICH Absolutely parallel grammars and two-way finite state transducers. J.C.S.S. 6, 324–342, (1972)

    Google Scholar 

  21. G. ROZENBERG A. SALOMAA The mathematical theory of L-systems. Academic Press. (1980)

    Google Scholar 

  22. G. ROZENBERG (1) On ETOL system of finite index. Inform and control 38, 103–133 (1978)

    Google Scholar 

  23. (2) On the effect of the finite index restriction on several families of grammars. Inform and control 39, 284–302 (1978)

    Google Scholar 

  24. B. ROZOY (1) The Dyck language D′*1 doesn't belong to the family of finite index matrix grammar languages. T.R. Un. Paris VI.VII. LITP. 1985

    Google Scholar 

  25. (2) Quelques résultats pour les transducteurs boustrophédons. T.R. Un. Paris VI–VII. LITP — 1985 — Submited to RAIRO.

    Google Scholar 

  26. SALOMAA (1) On the index of context free grammars and languages. Inform and control 14, 474–477-(1969)

    Google Scholar 

  27. (2) Formal languages — Academic Press.

    Google Scholar 

  28. MP. SCHUTZENBERGER On a special case of regular events. Annals of Math. Stat. 32 (1961) 1201–1213.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Labo. d'Informatique, Université, F. 14032, Caen-cedex

    B. Rozoy

Authors
  1. B. Rozoy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Lothar Budach

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rozoy, B. (1985). About two-way transducers. In: Budach, L. (eds) Fundamentals of Computation Theory. FCT 1985. Lecture Notes in Computer Science, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028821

Download citation

  • DOI: https://doi.org/10.1007/BFb0028821

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15689-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation