Skip to main content
SpringerLink
Log in

On twist-closed trios: A new morphic characterization of r.e. sets

  • Chapter
  • First Online:
Foundations of Computer Science

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

Abstract

We show that in conjunction with the usual trio operations the combination of twist and product can simulate any combination of intersection, reversal and 1/2. It is proved that any recursively enumerable language L can be homomorphically represented by twisting a linear context-free language. Indeed, the recursively enumerable sets form the least twist-closed full trio generated by dMIR:=wcw rev ¦ w ε a,b *.

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.

References

  1. B.S. Baker and R.V. Book. Reversal-bounded multipushdown machines, J.Comput. Syst. Sci., 8 (1974) 315–332.

    MathSciNet  Google Scholar 

  2. J. Berstel, Transductions and Context-free Languages, Teubner Stuttgart (1980).

    Google Scholar 

  3. R.V. Book and S. Greibach. Quasi-realtime languages, Math. Syst. Theory 19 (1970) 97–111.

    Article  MathSciNet  Google Scholar 

  4. R.V. Book and S. Greibach. The independence of certain operations on semiAFLs, RAIRO Informatique Théorique, 19 (1978) 369–385.

    MathSciNet  Google Scholar 

  5. R.V. Book, S. Greibach, C. Wrathall. Reset machines, J. Comput. Syst. Sci., 19 (1979) 256–276.

    Article  MathSciNet  Google Scholar 

  6. R.V. Book, M. Nivat, and M. Paterson. Reversal-bounded acceptors and intersections of linear languages, Siam J. on Computing, 3 (1974) 283–295.

    Article  MathSciNet  Google Scholar 

  7. F.J. Brandenburg. Representations of language families by homomorphic equality operations and generalized equality sets, Theoretical Computer Science, 55 (1987) 183–263.

    Article  MATH  MathSciNet  Google Scholar 

  8. F.J. Brandenburg. On the intersection of stacks and queues, Theoretical Computer Science, 58 (1988) 69–80.

    Article  MATH  MathSciNet  Google Scholar 

  9. K. Culik. A purely homomorphic characterization of recursively enumerable sets, J. ACM 26 (1979) 345–350.

    Article  MATH  MathSciNet  Google Scholar 

  10. J. Engelfriet and G. Rozenberg. Equality languages and fixed point languages, Information and Control, 43 (1979) 20–49.

    Article  MathSciNet  Google Scholar 

  11. J. Engelfriet. Reverse twin shuffles, Bulletin of the EATCS, vol. 60 (1996) 144.

    MATH  Google Scholar 

  12. S. Ginsburg, Algebraic and Automata Theoretic Properties of Formal Languages, North Holland Publ. Comp. Amsterdam (1975).

    Google Scholar 

  13. S. Ginsburg and J. Goldstein. Intersection-closed full AFL and the recursively enumerable languages, Information and Control, 22 (1973) 201–231.

    Article  MathSciNet  Google Scholar 

  14. S. Ginsburg and S. Greibach, Principal AFL, J. Comput. Syst. Sci., 4 (1970) 308–338.

    MathSciNet  Google Scholar 

  15. S. Greibach. Remarks on blind and partially blind one-way multicounter machines, Theoretical Computer Science, 7 (1978) 311–236.

    Article  MATH  MathSciNet  Google Scholar 

  16. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley Publ. Comp. (1997).

    Google Scholar 

  17. M. Jantzen.On the hierarchy of Petri net languages, R.A.I.R.O., Informatique Théorique, 13 (1979) 19–30.

    MATH  MathSciNet  Google Scholar 

  18. M. Jantzen and H. Petersen. Petri net languages and one-sided reductions of context-free sets, in: (K Voss, H. Genrich, and G. Rozenberg, eds.) Concurrency and Nets, Springer, Berlin, Heidelberg, New York (1987) 245–252.

    Google Scholar 

  19. M. Jantzen and H. Petersen. Twisting Petri net languages and how to obtain them by reducing linear context-free sets, in: Proc. 12th Internat. Conf. on Petri Nets, Gjern (1991) 228–236.

    Google Scholar 

  20. M. Jantzen and H. Petersen. Cancellation in context-free languages: enrichment by reduction. Theoretical Computer Science, 127 (1994) 149–170.

    Article  MathSciNet  Google Scholar 

  21. S.R. Kosaraju. Decidability of reachability of vector addition systems, 14th Annual ACM Symp. on Theory of Computing, San Francisco, (1982) 267–281.

    Google Scholar 

  22. E.W. Mayr. An algorithm for the general Petri net reachability problem,SIAM J. of Computing, 13 (1984) 441–459.

    Article  MATH  MathSciNet  Google Scholar 

  23. A. Salomaa. Equality sets for homomorphisms and free monoids, Acta Cybernetica 4 (1978) 127–139.

    MATH  MathSciNet  Google Scholar 

  24. A. Salomaa. Jewels of formal Language Theory, Computer Science Press, Rockville (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Hamburg FB Informatik, Universität Hamburg, Vogt-Kölln-Straße 30, 22527, Hamburg

    Matthias Jantzen

Authors
  1. Matthias Jantzen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Freksa Matthias Jantzen Rüdiger Valk

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jantzen, M. (1997). On twist-closed trios: A new morphic characterization of r.e. sets. In: Freksa, C., Jantzen, M., Valk, R. (eds) Foundations of Computer Science. Lecture Notes in Computer Science, vol 1337. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052082

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63746-2

  • Online ISBN: 978-3-540-69640-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation