Skip to main content
SpringerLink
Log in

Automata and Binary Decision Diagrams

  • Conference paper
  • First Online:
Automata Implementation (WIA 1998)

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

Included in the following conference series:

Abstract

We show that the concept of automata minimization leads to a nice interpretation of the famous canonicity of binary decision diagrams discovered by Bryant.

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. S. B. Akers, Binary Decision Diagrams, IEEE Transactions on Computers C-27(6) (1978) 509–516.

    Article  Google Scholar 

  2. R. E. Bryant, Graph Based Algorithms for Boolean Functions Manipulation, IEEE Transactions on Computers C-35(8) (1986) 677–691.

    Article  Google Scholar 

  3. R. E. Bryant, Binary Decision Diagrams and beyond, Survey Report, Carnegie Mellon University.

    Google Scholar 

  4. J.-M. Champarnaud and J.-E. Pin, A Maxmin Problem on Finite Automata, Discrete Applied Mathematics 23 (1989) 91–96.

    Article  MATH  MathSciNet  Google Scholar 

  5. S. J. Friedman, K. J. Supowit, Finding the Optimal Ordering for Binary Decision Diagram, IEEE Transactions on Computers 39(5) (1990).

    Google Scholar 

  6. H.-T. Liaw and C.-S. Lin, On the OBDD Representation of General Boolean Functions, IEEE Transactions on Computers C-41(46) (1992) 661–664.

    Article  MathSciNet  Google Scholar 

  7. A. Nerode, Linear Automata Transformation, Proc. AMS 9 (1958) 541–544.

    Google Scholar 

  8. D. Revuz, Minimization of Acyclic Deterministic Automata in Linear Time, Theoret. Comput. Sci. 92 (1992) 181–189.

    Article  MATH  MathSciNet  Google Scholar 

  9. I. Wegener, Efficient Data Structure for Boolean Functions, Discrete Mathematics 136 (1994) 347–372.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFAR Université de Rouen, Faculté des Sciences et des Techniques, 76821, Mont-Saint-Aignan Cedex, France

    Jean-Francis Michon & Jean-Marc Champarnaud

Authors
  1. Jean-Francis Michon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean-Marc Champarnaud
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Laboratory, University of Rouen, F-76821, Mont-Saint-Aignan Cedex, France

    Jean-Marc Champarnaud  & Djelloul Ziadi  & 

  2. LI/E3i University of Tours, 64 avenue Jean Portalis, F-37200, Tours, France

    Denis Maurel

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Michon, JF., Champarnaud, JM. (1999). Automata and Binary Decision Diagrams. In: Champarnaud, JM., Ziadi, D., Maurel, D. (eds) Automata Implementation. WIA 1998. Lecture Notes in Computer Science, vol 1660. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48057-9_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-48057-9_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66652-3

  • Online ISBN: 978-3-540-48057-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation