Skip to main content
SpringerLink
Log in

Parallel Induction of Nondeterministic Finite Automata

  • Conference paper
  • First Online:
Parallel Processing and Applied Mathematics (PPAM 2015)

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

Abstract

The induction of a minimal nondeterministic finite automaton (NFA) consistent with a given set of examples and counterexamples, which is known to be computationally hard, is discussed. The paper is an extension to the novel approach of transforming the problem of NFA induction into the integer nonlinear programming (INLP) problem. An improved formulation of the problem is proposed along with the two parallel algorithms to solve it. The methods for the distribution of tasks among processors along with distributed termination detection are presented. The experimental results for selected benchmarks are also reported.

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

Institutional subscriptions

Notes

  1. 1.

    The implementations of the RPNI and EDSM algorithms were taken from the open source project of grammatical inference tools (gitoolbox) available at https://code.google.com/p/gitoolbox. The toolbox is described in [13].

References

  1. Gold, E.M.: Complexity of automaton identification from given data. Inf. Control 37, 302–320 (1978)

    Article  MathSciNet  Google Scholar 

  2. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22, 1117–1141 (1993)

    Article  MathSciNet  Google Scholar 

  3. Angluin, D.: An application of the theory of computational complexity to the study of inductive inference. Ph.D. thesis, University of California (1976)

    Google Scholar 

  4. Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the abbadingo one DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, pp. 1–12. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Dupont, P.: Regular grammatical inference from positive and negative samples by genetic search: the GIG method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS (LNAI), vol. 862, pp. 236–245. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  6. García, P., Vázquez de Parga, M., Álvarez, G.I., Ruiz, J.: Learning regular languages using non-deterministic finite automata. In: Ibarra, O.H., Ravikumar, B. (eds.) Implementation and Applications of Automata, pp. 92–101. Springer, New York (2008)

    Chapter  Google Scholar 

  7. Wieczorek, W., Nowakowski, A.: Grammatical inference in the discovery of generating functions. In: Gruca, A., Brachman, A., Czachórski, T., Kozielski, S. (eds.) Man–Machine Interactions 4. AISC, vol. 391, pp. 627–637. Springer International Publishing, Switzerland (2016)

    Chapter  Google Scholar 

  8. Imada, K., Nakamura, K.: Learning context free grammars by using SAT solvers. In: International Conference on Machine Learning and Applications, ICMLA 2009, 13–15 December 2009, Miami Beach, FL, USA, pp. 267–272 (2009)

    Google Scholar 

  9. Wieczorek, W.: Induction of non-deterministic finite automata on supercomputers. In: Heinz, J., de la Higuera, C., Oates, T. (eds.) JMLR Workshop and Conference, Proceedings of the Eleventh International Conference on Grammatical Inference, ICGI 2012, 5–8 September 2012, University of Maryland, College Park, USA, vol. 21, pp. 237–242 (2012)

    Google Scholar 

  10. Quinn, M.J.: Parallel Programming in C with MPI and OpenMP. McGraw-Hill, New York (2004)

    Google Scholar 

  11. Dijkstra, E.W., Seijen, W.H., van Gasteren, A.J.M.: Derivation of a termination detection algorithm for distributed computations. Inf. Process. Lett. 16, 217–219 (1983)

    Article  MathSciNet  Google Scholar 

  12. Tomita, M.: Dynamic construction of finite automata from examples using hill-climbing. In: Proceedings of the Fourth Annual Conference of the Cognitive Science Society, pp. 105-108 (1982)

    Google Scholar 

  13. Akram, H.I., de la Higuera, C., Xiao, H., Eckert, C.: Grammatical inference algorithms in MATLAB. In: Sempere, J.M., García, P. (eds.) ICGI 2010. LNCS, vol. 6339, pp. 262–266. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Acknowledgment

Computations were carried out using the computer cluster Galera at the Academic Computer Center in Gdańsk (http://task.gda.pl/kdm) and using the computer cluster Ziemowit (http://ziemowit.hpc.polsl.pl) funded by the Silesian BIO-FARMA project No. POIG.02.01.00-00-166/08 in the Computational Biology and Bioinformatics Laboratory of the Biotechnology Centre in the Silesian University of Technology, Gliwice, Poland.

This research was supported by Grant No. DEC-2011/03/B/ST6/01588 from National Science Center of Poland and the Institute of Informatics research grant no. 525/RAU2/2014/9.

Author information

Authors and Affiliations

  1. Institute of Informatics, Silesian University of Technology, Gliwice, Poland

    Tomasz Jastrzab & Zbigniew J. Czech

  2. Institute of Informatics, University of Silesia, Sosnowiec, Poland

    Wojciech Wieczorek

Authors
  1. Tomasz Jastrzab
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zbigniew J. Czech
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wojciech Wieczorek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tomasz Jastrzab .

Editor information

Editors and Affiliations

  1. Czestochowa University of Technolog, Czestochowa, Poland

    Roman Wyrzykowski

  2. Department of Computer Science, University of Southern California, Marina Del Rey, California, USA

    Ewa Deelman

  3. Electrical Engineering & Comput. Science, University of Tennessee, Knoxville, Tennessee, USA

    Jack Dongarra

  4. Czestochowa University of Technology, Institute of Computer & Information Sci., Czestochowa, Poland

    Konrad Karczewski

  5. Department of Computer Science, AGH University of Science and Technology, Krakow, Poland

    Jacek Kitowski

  6. Systèmes d’informations, Big Data et Rec, AGH University of Science and Technology, Krakow, Poland

    Kazimierz Wiatr

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Jastrzab, T., Czech, Z.J., Wieczorek, W. (2016). Parallel Induction of Nondeterministic Finite Automata. In: Wyrzykowski, R., Deelman, E., Dongarra, J., Karczewski, K., Kitowski, J., Wiatr, K. (eds) Parallel Processing and Applied Mathematics. PPAM 2015. Lecture Notes in Computer Science(), vol 9573. Springer, Cham. https://doi.org/10.1007/978-3-319-32149-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-32149-3_24

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-32148-6

  • Online ISBN: 978-3-319-32149-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation