Skip to main content
Springer Nature Link
Log in

Minimal DFA for Symmetric Difference NFA

  • Conference paper
Descriptional Complexity of Formal Systems (DCFS 2012)

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

Included in the following conference series:

  • 554 Accesses

Abstract

Recently, a characterization of the class of nondeterministic finite automata (NFAs) for which determinization results in a minimal deterministic finite automaton (DFA), was given in [2]. We present a similar result for the case of symmetric difference NFAs. Also, we show that determinization of any minimal symmetric difference NFA produces a minimal DFA.

This research was supported by the National Research Foundation of South Africa, by the ERDF funded Estonian Center of Excellence in Computer Science, EXCS, by the Estonian Science Foundation grant 7520, and by the Estonian Ministry of Education and Research target-financed research theme no. 0140007s12.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Brzozowski, J.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of the Symposium on the Mathematical Theory of Automata. MRI Symposia Series, pp. 529–561. Polytechnic Press of Polytechnic Institute of Brooklyn (1963)

    Google Scholar 

  2. Brzozowski, J., Tamm, H.: Theory of Átomata. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 105–116. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  3. Brzozowski, J., Tamm, H.: Quotient complexities of atoms of regular languages. In: Proceedings of the 16th International Conference on Developments in Language Theory (DLT). Springer (August 2012)

    Google Scholar 

  4. Denis, F., Lemay, A., Terlutte, A.: Residual Finite State Automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 144–157. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  5. Dornhoff, L., Hohn, F.: Applied Modern Algebra. Macmillan Publishing Company (1978)

    Google Scholar 

  6. Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer Publishing Company, Incorporated (2009)

    Google Scholar 

  7. Droste, M., Rahonis, G.: Weighted Automata and Weighted Logics on Infinite Words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 49–58. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages and Computation. Addison Wesley (1979)

    Google Scholar 

  9. Ilie, L., Navarro, G., Yu, S.: On NFA Reductions. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Salomaa Festschrift. LNCS, vol. 3113, pp. 112–124. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM Journal on Computing 22(6), 1117–1141 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kirsten, D., Mäurer, I.: On the determinization of weighted automata. Journal of Automata, Languages and Combinatorics 10(2/3), 287–312 (2005)

    MathSciNet  MATH  Google Scholar 

  12. Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23(2), 269–311 (1997)

    MathSciNet  Google Scholar 

  13. Stone, H.: Discrete Mathematical Structures. Science Research Associates (1973)

    Google Scholar 

  14. van der Merwe, B., van Zijl, L., Geldenhuys, J.: Ambiguity of Unary Symmetric Difference NFAs. In: Cerone, A., Pihlajasaari, P. (eds.) ICTAC 2011. LNCS, vol. 6916, pp. 256–266. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Van Zijl, L.: Generalized Nondeterminism and the Succinct Representation of Regular Languages. Ph.D. thesis, Stellenbosch University (November 1997)

    Google Scholar 

  16. Van Zijl, L.: On binary symmetric difference NFAs and succinct representations of regular languages. Theoretical Computer Science 328(1), 161–170 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  17. Vuillemin, J., Gama, N.: Compact Normal Form for Regular Languages as Xor Automata. In: Maneth, S. (ed.) CIAA 2009. LNCS, vol. 5642, pp. 24–33. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Stellenbosch University, Private Bag X1, 7602, Matieland, South Africa

    Brink van der Merwe & Lynette van Zijl

  2. Institute of Cybernetics, Tallinn University of Technology, Akadeemia tee 21, 12618, Tallinn, Estonia

    Hellis Tamm

Authors
  1. Brink van der Merwe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hellis Tamm
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lynette van Zijl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstraße 2, 35392, Giessen, Germany

    Martin Kutrib

  2. Departamento de Ciência de Computadores, Universidade do Porto, Faculdade de Ciências, Rua do Campo Alegre 1021-1055, 4169-007, Porto, Portugal

    Nelma Moreira  & Rogério Reis  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van der Merwe, B., Tamm, H., van Zijl, L. (2012). Minimal DFA for Symmetric Difference NFA. In: Kutrib, M., Moreira, N., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2012. Lecture Notes in Computer Science, vol 7386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31623-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31623-4_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31622-7

  • Online ISBN: 978-3-642-31623-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics