Skip to main content
SpringerLink
Log in

Improved Bounds on the Number of Automata Accepting Finite Languages

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2002)

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

Included in the following conference series:

Abstract

We improve the known bounds on the number of pairwise non-isomorphic minimal deterministic finite automata (DFAs) on n states which accept finite languages. The lower bound constructions are iterative approaches which yield recurrence relations.

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. Domaratzki, M.: A generalization of the Genocchi numbers with applications to enumeration of finite automata. Submitted (Preliminary version available at http://www.cs.queensu.ca.TechReports.Reports/2001-449.ps) (2001)

  2. Domaratzki, M., Kisman, D., Shallit, J.: On the number of distinct languages accepted by finite automata with n states. In Dassow, J., Wotschke, D., eds.: 3rd. Intl. Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, 2001. (2001) 66–78

    Google Scholar 

  3. Harrison, M.; A census of finite automata. Can. J. Math 17 (1965) 100–113

    MATH  MathSciNet  Google Scholar 

  4. Liskovets, V.: The number of connected intial automata. Cybernetics 5 (1969) 259–262

    Article  Google Scholar 

  5. Korshunov, A.: Enumeration of finite automata (In Russian). Problemy Kibernetiki 34 (1978) 5–82

    MathSciNet  Google Scholar 

  6. Radke, C.: Enumeration of strongly connected sequential machines. Information and Control 8 (1965) 377–389

    Article  MATH  MathSciNet  Google Scholar 

  7. Robinson, R.: Counting strongly connected finite automata. In Alavi, Y., Chartrand, G., Lick, D., Wall, C., eds.: Graph Theory with Applications to Algorithms and Computer Science, Wiley (1985) 671–685

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing, Queen’s University, K7L 4S6, Kingston, ON, Canada

    Mike Domaratzki

Authors
  1. Mike Domaratzki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Domaratzki, M. (2003). Improved Bounds on the Number of Automata Accepting Finite Languages. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_18

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation