Skip to main content
SpringerLink
Log in

Incremental Minimization of Symbolic Automata

  • Conference paper
  • First Online:
Verified Software. Theories, Tools, and Experiments (VSTTE 2019)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 12031))

  • 464 Accesses

Abstract

Symbolic automata are generalizations of finite automata that have symbolic predicates over the alphabet as transitions instead of symbols. Recently, traditional automata minimization techniques have been generalized to symbolic automata. In this paper, we generalize the incremental minimization algorithm to symbolic automata such that the algorithm can be halted at any point for obtaining a partially minimized automaton. Instead of computing the sets of equivalence classes, the incremental algorithm checks for equivalence between pairs of states and if they are equivalent, merges them into a single state. We evaluate our algorithm on SFAs corresponding to Unicode regular expressions and compare them to the state-of-the-art symbolic automata minimization implementations.

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.

    https://github.uconn.edu/jah12014/symbolic-automata-research.

  2. 2.

    https://github.com/lorisdanto/symbolicautomata.

References

  1. Regexlib. http://www.regexlib.com/

  2. Almeida, M., Moreira, N., Reis, R.: On the performance of automata minimization algorithms. In: Proceedings of the 4th Conference on Computation in Europe: Logic and Theory of Algorithms, pp. 3–14 (2007)

    Google Scholar 

  3. Almeida, M., Moreira, N., Reis, R.: Incremental DFA minimisation. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 39–48. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-18098-9_5

    Chapter  Google Scholar 

  4. Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. Math. Theory Automata 12(6), 529–561 (1962)

    Google Scholar 

  5. D’Antoni, L., Veanes, M.: Minimization of symbolic automata. In: ACM SIGPLAN Notices, vol. 49, pp. 541–553. ACM (2014)

    Google Scholar 

  6. D’Antoni, L., Veanes, M.: Forward bisimulations for nondeterministic symbolic finite automata. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 518–534. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-662-54577-5_30

    Chapter  Google Scholar 

  7. D’Antoni, L.: Symbolicautomata. https://github.com/lorisdanto/symbolicautomata/. Accessed 30 Oct 2017

  8. D’Antoni, L., Veanes, M.: The power of symbolic automata and transducers. In: Majumdar, R., Kunčak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 47–67. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-63387-9_3

    Chapter  Google Scholar 

  9. García, P., de Parga, M., Velasco, J.A., López, D.: A split-based incremental deterministic automata minimization algorithm. Theory Comput. Syst. 57(2), 319–336 (2015)

    Article  MathSciNet  Google Scholar 

  10. Hartmanis, J.: Algebraic structure theory of sequential machines (prentice-hall international series in applied mathematics) (1966)

    Google Scholar 

  11. Hopcroft, J.: An n log n algorithm for minimizing states in a finite automaton. In: Theory of Machines and Computations, pp. 189–196, Elsevier (1971)

    Google Scholar 

  12. Huffman, D.A.: The synthesis of sequential switching circuits. J. Franklin Inst. 257(3), 161–190 (1954)

    Article  MathSciNet  Google Scholar 

  13. Moore, E.F.: Gedanken-experiments on sequential machines. Automata stud. 34, 129–153 (1956)

    MathSciNet  Google Scholar 

  14. Saarikivi, O., Veanes, M.: Minimization of symbolic transducers. In: Majumdar, R., Kunčak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 176–196. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-63390-9_10

    Chapter  Google Scholar 

  15. van Noord, G., Gerdemann, D.: Finite state transducers with predicates and identities. Grammars 4(3), 263–286 (2001)

    Article  MathSciNet  Google Scholar 

  16. Veanes, M., De Halleux, P., Tillmann, N.: Rex: symbolic regular expression explorer. In: International Conference on Software Testing, Verification and Validation, pp. 498–507. IEEE (2010)

    Google Scholar 

  17. Watson, B.W.: Implementing and using finite automata toolkits. Nat. Lang. Eng. 2(4), 295–302 (1996)

    Article  MathSciNet  Google Scholar 

  18. Watson, B.W.: An incremental DFA minimization algorithm. In: International Workshop on Finite-State Methods in Natural Language Processing, Helsinki, Finland (2001)

    Google Scholar 

Download references

Acknowledgements

The authors would like to thank anonymous reviews for their feedback. The work done in this paper is based upon work supported by the National Science Foundation (NSF) under grant numbers CNS 1739936, 1935724. Any opinions, findings, and conclusions or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of NSF.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Connecticut, Storrs, USA

    Jonathan Homburg

  2. Department of Computer Science, University of North Carolina Chapel Hill, Chapel Hill, USA

    Parasara Sridhar Duggirala

Authors
  1. Jonathan Homburg
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Parasara Sridhar Duggirala
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Parasara Sridhar Duggirala .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology Bombay, Mumbai, India

    Supratik Chakraborty

  2. SRI International, Menlo Park, CA, USA

    Jorge A. Navas

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Homburg, J., Duggirala, P.S. (2020). Incremental Minimization of Symbolic Automata. In: Chakraborty, S., Navas, J. (eds) Verified Software. Theories, Tools, and Experiments. VSTTE 2019. Lecture Notes in Computer Science(), vol 12031. Springer, Cham. https://doi.org/10.1007/978-3-030-41600-3_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-41600-3_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-41599-0

  • Online ISBN: 978-3-030-41600-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation