Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Rational Graphs Trace Context-Sensitive Languages

  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 2001 (MFCS 2001)

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

  • 913 Accesses

Abstract

This paper shows that the traces of rational graphs coincide with the context-sensitive languages.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Autebert, J.-M. and Boasson, L.Transductions rationelles. Masson, 1988.

    Google Scholar 

  2. Berstel, J.Transductions and contextfree languages. Teubner, 1979.

    Google Scholar 

  3. Moller, F. Burkart, O., Caucal, D. and Steffen B.Handbook of Process Algebra, chapter Verification on infinite structures, pages 545–623. Elsevier, 2001.

    Google Scholar 

  4. Caucal, D. On transition graphs having a decidable monadic theory. In Icalp 96, volume 1099 of LNCS, pages 194–205, 1996.

    Google Scholar 

  5. Courcelle, B.Handbook of Theoretical Computer Science, chapter Graph rewriting: an algebraic and logic approach. Elsevier, 1990.

    Google Scholar 

  6. Ginsburg, S. and Rose, G. F. Preservation of languages by transducers. Information and control, 9:153–176, 1966.

    Article  MATH  MathSciNet  Google Scholar 

  7. Knapik, T. and Payet, E. Synchronization product of linear bounded machines. In FCT, volume 1684 of LNCS, pages 362–373, 1999.

    Google Scholar 

  8. Mateescu, A., Salomaa, A.Handbook of Formal Languages, volume 1, chapter Aspects of classical language theory, pages 175–252. Springer-Verlag, 1997.

    Google Scholar 

  9. Morvan, C. On rational graphs. In Fossacs 00, volume 1784 of LNCS, pages 252–266, 2000.

    Google Scholar 

  10. Muller, D. and Schupp, P. The theory of ends, pushdown automata, and secondorder logic. Theoretical Computer Science, 37:51–75, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  11. Penttonen, M. One-sided and two-sided context in formal grammars. Information and Control, 25:371–392, 1974.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, Campus de Beaulieu, 35042, Rennes, France

    Christophe Morvan

  2. Division of Informatics, Uiversity of Edinburgh, UK

    Colin Stirling

Authors
  1. Christophe Morvan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Colin Stirling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mathematical Institute, AS CR, Žitná 25, 115 67, Praha 1, Czech Republic

    Jiří Sgall

  2. Faculty of Mathematics and Physics Institute for Theoretical Computer Science (ITI), Charles University, Malostranské náměstí 25, 118 00, Praha 1, Czech Republic

    Aleš Pultr  & Petr Kolman  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Morvan, C., Stirling, C. (2001). Rational Graphs Trace Context-Sensitive Languages. In: Sgall, J., Pultr, A., Kolman, P. (eds) Mathematical Foundations of Computer Science 2001. MFCS 2001. Lecture Notes in Computer Science, vol 2136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44683-4_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-44683-4_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42496-3

  • Online ISBN: 978-3-540-44683-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation