Skip to main content
SpringerLink
Log in
Book cover

International Conference on Current Trends in Theory and Practice of Informatics

SOFSEM 2015: SOFSEM 2015: Theory and Practice of Computer Science pp 389–400Cite as

On Visibly Pushdown Trace Languages

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8939))

Abstract

We present a characterization of the class of (linearizations of) visibly pushdown trace languages in terms of cooperating distributed systems (CD-systems) of stateless deterministic restarting automata with window size one that use an external pushdown store for computing the global successor relation.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aalbersberg, I., Rozenberg, G.: Theory of traces. Theoret. Comput. Sci. 60, 1–82 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC 2004, pp. 202–211. ACM Press (2004)

    Google Scholar 

  3. Bordihn, H., Holzer, M., Kutrib, M.: Input reversals and iterated pushdown automata: a new characterization of Khabbaz geometric hierarchy of languages. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 102–113. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Bertoni, A., Mauri, G., Sabadini, N.: Membership problems for regular and context-free trace languages. Inform. Comput. 82, 135–150 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bollig, B., Grindei, M.L., Habermehl, P.: Realizability of concurrent recursive programs. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 410–424. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Braunmühl, B., von Verbeek, R.: Input-driven languages are recognized in log n space. In: Karpinski, M. (ed.) FCT 1983. LNCS, vol. 158, pp. 40–51. Springer, Heidelberg (1983)

    Chapter  Google Scholar 

  7. Diekert, V., Rozenberg, G.: The Book of Traces. World Scientific, Singapore (1995)

    Book  Google Scholar 

  8. Kutrib, M., Messerschmidt, H., Otto, F.: On stateless two-pushdown automata and restarting automata. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) Proc. Automata and Formal Languages, AFL 2008, pp. 257–268. Computer and Automation Research Institute, Hungarian Academy of Sciences (2008)

    Google Scholar 

  9. Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus (1977)

    Google Scholar 

  10. Messerschmidt, H., Otto, F.: Cooperating distributed systems of restarting automata. Intern. J. Found. Comput. Sci. 18, 1333–1342 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata accept all rational trace languages. In: Dediu, A.-H., Fernau, H., Martín-Vide, C. (eds.) LATA 2010. LNCS, vol. 6031, pp. 463–474. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Nagy, B., Otto, F.: On CD-systems of stateless deterministic R-automata with window size one. JCSS 78, 780–806 (2012)

    MATH  MathSciNet  Google Scholar 

  13. Nagy, B., Otto, F.: An automata-theoretical characterization of context-free trace languages. In: Černá, I., Gyimóthy, T., Hromkovič, J., Jefferey, K., Králović, R., Vukolić, M., Wolf, S. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 406–417. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  14. Nagy, B., Otto, F.: CD-systems of stateless deterministic R(1)-automata governed by an external pushdown store. RAIRO 45, 413–448 (2011)

    MATH  MathSciNet  Google Scholar 

  15. Nagy, B., Otto, F.: Deterministic pushdown-CD-systems of stateless deterministic R(1)-automata. Acta Inform. 50, 229–255 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  16. Nagy, B., Otto, F.: Globally deterministic CD-systems of stateless R-automata with window size 1. Intern. J. Comput. Math. 90, 1254–1277 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  17. Srba, J.: Visibly pushdown automata: From language equivalence to simulation and bisimulation. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 89–103. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  18. Zielonka, W.: Notes on finite asynchronous automata. RAIRO 21, 99–135 (1987)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Elektrotechnik/Informatik, Universität Kassel, 34109, Kassel, Germany

    Friedrich Otto

Authors
  1. Friedrich Otto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Rome Tor Vergata, 00133, Rome, Italy

    Giuseppe F. Italiano

  2. University of Limerick, Ireland

    Tiziana Margaria-Steffen

  3. Charles University, Prague, Czech Republic

    Jaroslav Pokorný

  4. Université catholique de Louvain, Louvain, Belgium

    Jean-Jacques Quisquater

  5. ETH Zurich, Zurich, Switzerland

    Roger Wattenhofer

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otto, F. (2015). On Visibly Pushdown Trace Languages. In: Italiano, G.F., Margaria-Steffen, T., Pokorný, J., Quisquater, JJ., Wattenhofer, R. (eds) SOFSEM 2015: Theory and Practice of Computer Science. SOFSEM 2015. Lecture Notes in Computer Science, vol 8939. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-46078-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-46078-8_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-46077-1

  • Online ISBN: 978-3-662-46078-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation