Skip to main content
SpringerLink
Log in

Recognizing Shuffled Languages

  • Conference paper
Language and Automata Theory and Applications (LATA 2011)

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

Abstract

Language models that use interleaving, or shuffle, operators have applications in various areas of computer science, including system verification, plan recognition, and natural language processing. We study the complexity of the membership problem for such models, i.e., how difficult it is to determine if a string belongs to a language or not. In particular, we investigate how interleaving can be introduced into models that capture the context-free languages.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barton, G.E.: On the complexity of ID/LP parsing 1. Comput. Linguist. 11(4), 205–218 (1985)

    Google Scholar 

  2. Berglund, M., Björklund, H., Högberg, J.: Recognizing shuffled languages. Technical Report UMINF 11.01, Computing Sci., Umeå University (2011), http://www8.cs.umu.se/research/uminf/index.cgi

  3. Biegler, F., Daley, M., McQuillan, I.: On the shuffle automaton size for words. In: DCFS, pp. 79–89 (2009)

    Google Scholar 

  4. Björklund, H., Bojańczyk, M.: Shuffle expressions and words with nested data. In: Kučera, L., Kučera, A. (eds.) MFCS 2007. LNCS, vol. 4708, pp. 750–761. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  5. Bloom, S.B., Ésik, Z.: Axiomatizing shuffle and concatenation in languages. Information and Comptuation 139(1), 62–91 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: Proc. LICS 2006, pp. 7–16 (2006)

    Google Scholar 

  7. Câmpeanu, C., Salomaa, K., Yu, S.: Tight lower bound for the state complexity of shuffle of regular languages. J. Autom. Lang. Comb. 7, 303–310 (2002)

    MathSciNet  MATH  Google Scholar 

  8. Carberry, S.: Techniques for plan recognition. User Modeling and User-Adapted Interaction 11(1-2), 31–48 (2001)

    Article  MATH  Google Scholar 

  9. Daley, M., Domaratzki, M., Salomaa, K.: Orthogonal concatenation: Language equations and state complexity. J. Universal Comp. Sci. 16(5), 653–675 (2010)

    MathSciNet  MATH  Google Scholar 

  10. Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)

    Book  MATH  Google Scholar 

  11. Ésik, Z., Bertol, M.: Nonfinite axiomatizability of the equational theory of shuffle. Acta Informatica 35(6), 505–539 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  12. Garg, V., Ragunath, M.: Concurrent regular expressions and their relationship to petri nets. Theor. Comput. Sci. 96(2), 285–304 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gelade, W., Martens, W., Neven, F.: Optimizing schema languages for XML: Numerical constraints and interleaving. SIAM J. on Comp. 39(4), 1486–1530 (2009)

    MATH  Google Scholar 

  14. Ginsburg, S.: The Mathematical Theory of Context Free Languages. McGraw-Hill, New York (1966)

    MATH  Google Scholar 

  15. Gischer, J.: Shuffle languages, petri nets, and context-sensitive grammars. Comm. ACM 24(9), 597–605 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  16. Högberg, J., Kaati, L.: Weighted unranked tree automata as a framework for plan recognition. In: Proc. Fusion (2010) (to appear)

    Google Scholar 

  17. Jedrzejowicz, J., Szepietowski, A.: Shuffle languages are in P. Theor. Comput. Sci. 250(1-2), 31–53 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  18. Kari, L., Sosík, P.: Aspects of shuffle and deletion on trajectories. Theor. Comput. Sci. 332, 47–61 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kuhlmann, M., Satta, G.: Treebank grammar techniques for non-projective dependency parsing. In: Proc. EACL, pp. 478–486 (2009)

    Google Scholar 

  20. Mateescu, A., Rozenberg, G., Salomaa, A.: Shuffle on trajectories: syntactic constraints. Theor. Comput. Sci. 197, 1–56 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  21. Mayer, A., Stockmeyer, L.: Word problems – this time with interleaving. Inform. and Comput. 115, 293–311 (1994)

    Article  MathSciNet  Google Scholar 

  22. Nivre, J.: Non-projective dependency parsing in expected linear time. In: Proc. ACL-IJCNLP 2009, pp. 351–359 (2009)

    Google Scholar 

  23. Schmidt, C., Sridharan, N., Goodson, J.: The plan recognition problem: An intersection of psychology and artificial intelligence. A.I. 11(1,2) (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, Umeå University, Sweden

    Martin Berglund, Henrik Björklund & Johanna Högberg

Authors
  1. Martin Berglund
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henrik Björklund
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Johanna Högberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Avinguda Catalunya, 35, 43002, Tarragona, Spain

    Adrian-Horia Dediu  & Carlos Martín-Vide  & 

  2. Department of Informatics, Kyushu University, 744 Motooka, 819–0395, Fukuoka, Japan

    Shunsuke Inenaga

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berglund, M., Björklund, H., Högberg, J. (2011). Recognizing Shuffled Languages. In: Dediu, AH., Inenaga, S., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2011. Lecture Notes in Computer Science, vol 6638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21254-3_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21254-3_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21253-6

  • Online ISBN: 978-3-642-21254-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation