Skip to main content
SpringerLink
Log in
Book cover

International Conference on Implementation and Application of Automata

CIAA 2015: Implementation and Application of Automata pp 211–223Cite as

The Membership Problem for Linear and Regular Permutation Languages

  • Conference paper
  • First Online:

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

Abstract

We analyze the complexity of membership problem for two subclasses of permutation languages: PermReg and PermLin. These are languages generated by regular and linear grammars respectively, extended by rules that allow to permute symbols in derivation, such as \(abX\rightarrow bXa\). We prove two NP-hardness results and analyze parameterized complexity of the problem.

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 EPUB and 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

References

  1. Berglund, M., Björklund, H., Björklund, J.: Shuffled languages - representation and recognition. Theor. Comput. Sci. 489–490, 1–20 (2013)

    Article  Google Scholar 

  2. Czerwinski, W., Lasota, S.: Partially-commutative context-free languages. EXPRESS/SOS, pp. 35–48 (2012)

    Google Scholar 

  3. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, London (2013)

    Book  Google Scholar 

  4. Esparza, J.: Petri nets, commutative context-free languages, and basic parallel processes. Fundam. Inform. 30, 23–41 (1997)

    MathSciNet  Google Scholar 

  5. 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 

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

    Article  MathSciNet  Google Scholar 

  7. Hopcroft, J.E., Ullmann, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Cambridge (1979)

    MATH  Google Scholar 

  8. Jędrzejowicz, J., Szepietowski, A.: Shuffle languages are in P. Theor. Comput. Sci. 250(1–2), 31–53 (2001)

    Article  MATH  Google Scholar 

  9. Karttunen, L., Kay, M.: Parsing in a free word order language. In: Dowty, D.R., et al. (eds.) Natural Language Parsing: Psychological, Computational, and Theoretical Perspectives, pp. 279–306. Cambridge University Press, Cambridge (2005)

    Google Scholar 

  10. Madejski, G.: Infinite hierarchy of permutation languages. Fundam. Inform. 130(3), 263–274 (2014)

    MathSciNet  MATH  Google Scholar 

  11. Nagy, B.: Languages generated by context-free grammars extended by type \({\rm AB}\rightarrow {\rm BA}\) rules. J. Autom. Lang. Comb. 14(2), 175–186 (2009)

    MathSciNet  MATH  Google Scholar 

  12. Nagy, B.: On a hierarchy of permutation languages. In: Ito, M., Kobayashi, Y., Shoji, K., (eds.) Automata, Formal Languages and Algebraic Systems, pp. 163–178. World Scientific, Singapore (2010)

    Google Scholar 

  13. Warmuth, M.K., Haussler, D.: On the complexity of iterated shuffle. J. Comput. Syst. Sci. 28(3), 345–358 (1984)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Gdańsk, Wita Stwosza 57, 80-952, Gdańsk, Poland

    Grzegorz Madejski

Authors
  1. Grzegorz Madejski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Grzegorz Madejski .

Editor information

Editors and Affiliations

  1. Umeå University, Umeå, Sweden

    Frank Drewes

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Madejski, G. (2015). The Membership Problem for Linear and Regular Permutation Languages. In: Drewes, F. (eds) Implementation and Application of Automata. CIAA 2015. Lecture Notes in Computer Science(), vol 9223. Springer, Cham. https://doi.org/10.1007/978-3-319-22360-5_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-22360-5_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-22359-9

  • Online ISBN: 978-3-319-22360-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation