Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Implementing Automata

WIA 1999: Automata Implementation pp 164–173Cite as

An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata

  • Conference paper
  • First Online:

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

Abstract

A locally threshold testable language L is a language with the property that for some nonnegative integers k and l, whether or not a word u is in the language L depends on (1) the prefix and suffix of the word u of length k-1 and (2) the set of intermediate substrings of length k of the word u where the sets of substrings occurring at least j times are the same, for j ≤ l. For given k and l the language is called l-threshold ktestable. A finite deterministic automaton is called l-threshold k-testable

New version of polynomial time algorithm to verify the local testability will be presented too.

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. A. Aho, J. Hopcroft, J. Ulman, The Design and Analisys of Computer Algorithms, Addison-Wesley, 1974.

    Google Scholar 

  2. J. Almeida, Implicit operations on finite J-trivial semigroups and a conjecture of I. Simon, J. Pure Appl. Alg., 69(1990), 205–208.

    Google Scholar 

  3. M.-P. Beal, J. Senellart, On the bound of the synchronization delay of local automata, Theoret. Comput. Sci. 205, 1-2(1998), 297–306.

    Article  MATH  MathSciNet  Google Scholar 

  4. D. Beauquier, J.E. Pin, Factors of words, Lect. Notes in Comp. Sci, Springer, Berlin, 372(1989), 63–79.

    Google Scholar 

  5. D. Beauquier, J.E. Pin, Languages and scanners, Theoret. Comp. Sci, 1, 84(1991), 3–21.

    Article  Google Scholar 

  6. J.-C. Birget, Strict local testability of the finite control of two-way automata and of regular picture description languages, J. of Alg. Comp., 1, 2(1991), 161–175.

    Article  MATH  MathSciNet  Google Scholar 

  7. J.A. Brzozowski, I. Simon, Characterizations of locally testable events, Discrete Math., 4, (1973), 243–271.

    Article  MATH  MathSciNet  Google Scholar 

  8. P. Caron, LANGAGE: A Maple package for automaton characterization of regular languages, Springer, Lect. Notes in Comp. Sci., 1436(1998), 46–55.

    Google Scholar 

  9. Z. Esik, I. Simon, Modelling literal morphisms by shuffle. Semigroup Forum, 56(1998), 2, 225–227.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Ginzburg, About some properties of definite, reverse-definite and related automata, IEEE Trans. Electron. Comput. EC-15(1966), 806–810.

    Article  Google Scholar 

  11. T. Head, Formal languages theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biol., 49(1987), 4, 739–757.

    Google Scholar 

  12. F. Hinz, Classes of picture languages that cannot be distinguished in the chain code concept and deletion of redundant retreats, Springer, Lect. Notes in Comp. Sci., 349(1990), 132–143.

    Google Scholar 

  13. S. Kim, R. McNaughton, R. McCloskey, An upper bound for the order of locally testable deterministic finite automaton, Lect. Notes in Comp. Sci., 401(1989), 48–65.

    Google Scholar 

  14. S. Kim, R. McNaughton, R. McCloskey, A polynomial time algorithm for the local testability problem of deterministic finite automata, IEEE Trans. Comput. 40(1991) N10, 1087–1093.

    Article  MathSciNet  Google Scholar 

  15. S. Kim, R. McNaughton, Computing the order of a locally testable automaton, Lect. Notes in Comp. Sci, Springer, 560(1991), 186–211.

    Google Scholar 

  16. G. Lallement, Semigroups and combinatorial applications, Wiley, N.Y., 1979.

    Google Scholar 

  17. S. W. Margolis, J.E. Pin, Languages and inverse semigroups, Lect. Notes in Comp. Sci, Springer, 199(1985), 285–299.

    MathSciNet  Google Scholar 

  18. R. McNaughton, S. Papert, Counter-free automata, M.I.T. Press Mass., 1971.

    Google Scholar 

  19. M. Minsky, S. Papert, Perceptrons, M.I.T. Press Mass., 1971, Cambridge, MA, 1969.

    Google Scholar 

  20. J. Pin, Finite semigroups and recognizable languages. An introduction, Semigroups and formal languages, Math. and Ph. Sci., 466(1995), 1–32.

    Google Scholar 

  21. M. Perles, M. O. Rabin, E. Shamir, The theory of definite automata, IEEE Trans. Electron. Comput. EC-12(1963), 233–243.

    Article  MathSciNet  Google Scholar 

  22. J. Reiterman, The Birkhoff theorem for finite algebras, Algebra Universalis, 14(1982), 1–10.

    Article  MATH  MathSciNet  Google Scholar 

  23. R.E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput., 1(1972), 146–160.

    Article  MATH  MathSciNet  Google Scholar 

  24. W. Thomas, Classifying regular events in symbolic logic, J. of Comp. System Sci, 25(1982), 360–376.

    Article  Google Scholar 

  25. A.N. Trahtman, The varieties of n-testable semigroups, Semigroup Forum, 27(1983), 309–318.

    Article  MATH  MathSciNet  Google Scholar 

  26. A.N. Trahtman, A polynomial time algorithm for local testability and its level. Int. J. of Algebra and Comp., v. 9, 1(1998), 31–39.

    Article  MathSciNet  Google Scholar 

  27. A.N. Trahtman, The identities of k-testable semigroups. Comm. in algebra, v. 27, 11(1999), 5405–5412.

    Article  MATH  MathSciNet  Google Scholar 

  28. A.N. Trahtman, A precise estimation of the order of local testability of a deterministic finite automaton, Springer, Lect. Notes in Comp. Sci., 1436(1998), 198–212.

    Google Scholar 

  29. Th. Wilke, Locally threshold testable languages of infinite words, Lect. Notes in Comp. Sci, Springer, Berlin, 665(1993), 63–79.

    Google Scholar 

  30. Th. Wilke, An algebraic theory for regular languages of finite and infinite words, Int. J. Alg. and Comput. 3(1993), 4, 447–489.

    Article  Google Scholar 

  31. Y. Zalcstein, Locally testable semigroups, Semigroup Forum, 5(1973), 216–227.

    Google Scholar 

  32. Y. Zalcstein, Locally testable languages, J. Comp. System Sci., 6(1972), 151–167.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dep. of Math. and CS, Bar-Ilan University, 59200, Ramat Gan, Israel

    A.N. Trahtman

Authors
  1. A.N. Trahtman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Potsdam, Institut für Informatik, August-Bebel-Straße 89, 14482, Potsdam, Germany

    Oliver Boldt

  2. Institut für Informatik, Universität Potsdam, Potsdam

    Helmut Jürgensen

  3. Department of Computer Science, The University of Western Ontario, London, Ontario, Canada, N6A 5B7

    Helmut Jürgensen

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Trahtman, A. (2001). An Algorithm to Verify Local Threshold Testability of Deterministic Finite Automata. In: Boldt, O., Jürgensen, H. (eds) Automata Implementation. WIA 1999. Lecture Notes in Computer Science, vol 2214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45526-4_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45526-4_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42812-1

  • Online ISBN: 978-3-540-45526-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation