Skip to main content
SpringerLink
Log in

Test Sets for Large Families of Languages

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2003)

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

Included in the following conference series:

Abstract

We study the lower and upper bounds for sizes of test sets for the families of all languages, of commutative languages, of regular languages and of 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. K.I. Appel, F.M. Djorup, On the equation z n1 z n2 ...z n k = y n in a free semigroup, Trans. Amer. Math. Soc. 134(1968), 461–471.

    Article  MATH  MathSciNet  Google Scholar 

  2. M.H. Albert, J. Lawrence, A proof of Ehrenfeucht’s Conjecture, Theoret. Comput. Sci. 41(1985) 121–123.

    Article  MATH  MathSciNet  Google Scholar 

  3. M.H. Albert, J. Lawrence, The descending chain condition on solution sets for systems of equations in groups, Proc. Edinburg Math. Soc. 29(1985), 69–73.

    Article  MathSciNet  Google Scholar 

  4. G. Baumslag, A. Myasnikov, V. Romankov, Two theorems about equationally noetherian groups, J. Algebra 194, 654–664, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  5. Choffrut, J. Karhumäki, Combinatorics of words, chapter in G. Rozenberg, A. Salomaa (Eds.), Handbook of formal languages, Vol. 1, 329–438, Springer-Verlag, 1997.

    Google Scholar 

  6. K. Culik II, J. Karhumäki, Systems of equations over free monoids and Ehrenfeucht’s Conjecture, Discrete. Math. 43(1983), 139–153.

    Article  MATH  MathSciNet  Google Scholar 

  7. V. Guba, The equivalence of infinite systems of equations in free groups and semigroups to finite subsystems, Matematiczeskije Zametki 40(3), September 1986 (in Russian).

    Google Scholar 

  8. I. Hakala, On word equations and the morphism equivalence problem for loop languages, Ph.D. Thesis, University of Oulu, Finland, 1997.

    MATH  Google Scholar 

  9. I. Hakala, J. Kortelainen, On the system of word equations x i1 x i2 ...x i m = y i1 y i2 ...y i n (i=1, 2,...) in a free monoid, Acta Inform. 34(1997), 217–230.

    Article  MATH  MathSciNet  Google Scholar 

  10. I. Hakala, J. Kortelainen, On the system of word equations x 0 u i1 x 1 u i2 x 2 u i3 x 3 = y 0 v i1 y 1 v i2 y 2 v i3 y 3 (i=0, 1, 2,... ) in a free monoid, Theoret. Comput. Sci. 225(1999), 149–161.

    Article  MATH  MathSciNet  Google Scholar 

  11. I. Hakala, J. Kortelainen, Polynomial size test sets for commutative languages, Rairo Informatique Theorique et Applications 31(1997), 191–304.

    MathSciNet  Google Scholar 

  12. T. Harju, J. Karhumäki, M. Petrich, Compactness of equations on completely regular semigroups, in J. Mycielski, G. Rozenberg, A. Salomaa (Eds.), Structures in Logic and Computer Science, LNCS 1261, 268–280, Springer-Verlag, 1997.

    Google Scholar 

  13. T. Harju, J. Karhumäki, W. Plandowski, Compactness of systems of equations in semigroups, Intern. J. Algebra Comput. 7, 457–470, 1997.

    Article  MATH  Google Scholar 

  14. M. A. Harrison, Introduction to Formal Language Theory, Addison-Wesley, Reading, MA, 1978.

    MATH  Google Scholar 

  15. S. Holub, Local and global cyclicity in free semigroups, Theoret. Comput. Sci. 262(2001), 25–36.

    Article  MATH  MathSciNet  Google Scholar 

  16. S. Jarominek, J. Karhumäki, W. Rytter, Efficient constructions of test sets for regular and context-free languages, Theoret. Comput. Sci. 116(1993), 305–316.

    Article  MATH  MathSciNet  Google Scholar 

  17. M.I. Kargapolov, Ju.I. Merzlakov, Basics of group theory, Nauka, 1982 (in Russian).

    Google Scholar 

  18. J. Karhumäki, W. Plandowski, On the Size of Independent Systems of Equations in Semigroups Theoret. Comput. Sci. 168(1): 105–119 (1996).

    Article  MATH  MathSciNet  Google Scholar 

  19. J. Karhumäki, W. Plandowski, W. Rytter, Polynomial size test sets for context-free languages, J. Comput. Syst. Sci 50(1995), 11–19.

    Article  MATH  Google Scholar 

  20. J. Kortelainen, On the system of word equations x 0 u i1 x 1...u m x m = y 0 v i1 y 1...v i n y n (i = 0, 1, 2,...) in a free monoid, Journal of Automata, Languages, and Combinatorics 3(1998), 43–58.

    MATH  MathSciNet  Google Scholar 

  21. J. Lawrence, The nonexistence of finite test set for set-equivalence of finite substitutions, Bull. EATCS 28, 34–37, 1986.

    MATH  Google Scholar 

  22. M. Lothaire, Combinatorics on words, Vol. 17 of Encyclopedia of Mathematics and its Apllications, Addison-Wesley, 1983. Reprinted in the Cambridge Mathematical Library, Cambridge University Press, 1997.

    Google Scholar 

  23. M. Lothaire II, Algebraic Combinatorics on words, Vol. 90 of Encyclopedia of Mathematics and its Applications, Cambridge University Press, 2002.

    Google Scholar 

  24. W. Plandowski, Testing equivalence of morphisms on context-free languages, in Lect. Notes in Comput. Sci. 855, 460–470, 1994.

    Google Scholar 

  25. W. Plandowski, The complexity of the morphism equivalence problem for context-free languages, Ph.D. Thesis, Warsaw University, 1995.

    Google Scholar 

  26. W. Plandowski, personal communication.

    Google Scholar 

  27. E.T. Poulsen, The ehrenfeucht conjecture: an algebra framework for its proof Aarhus Universitet, Matematisk Institut, 1985.

    Google Scholar 

  28. A. Salomaa, The ehrenfeucht conjecture: a proof for language theorist, manuscript.

    Google Scholar 

  29. J. Stalings, Finiteness properties of matrix representations, manuscript.

    Google Scholar 

  30. P. Turakainen, The equivalence of deterministic gsm replications on Q-rational languages is decidable, Math. Systems Theory 20(1987), 273–282.

    Article  MATH  MathSciNet  Google Scholar 

  31. P. Turakainen, The equivalence of dgsm replications on Q-rational languages is decidable, Proc. ICALP’88, LNCS 317, 654–666, Springer-Verlag, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, University of Warsaw, Banacha 2, 02-097, Warszawa, Poland

    Wojciech Plandowski

Authors
  1. Wojciech Plandowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plandowski, W. (2003). Test Sets for Large Families of Languages. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

  • Online ISBN: 978-3-540-45007-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation