skip to main content
10.1145/1593105.1593183acmotherconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
research-article

Minimal finite automata from finite training sets

Published: 28 March 2008 Publication History

Abstract

This paper describes a solution to the following problem: Given a finite set of strings A over an alphabet Σ and a positive integer n, find a deterministic finite automaton (DFA) with a minimal number of states that recognizes the strings in the given set but does not recognize any other strings of length less than n. It turns out that, for some sets of strings A and integers n, the DFA is not uniquely determined.

References

[1]
A. V. Aho and J. D. Ullman. The theory of parsing, translation, and compiling. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1972.
[2]
O. Cicchello and S. C. Kremer. Inducing grammars from sparse data sets: a survey of algorithms and results. J. Mach. Learn. Res., 4:603--632, 2003.
[3]
E. M. Gold. Language identification in the limit. Information and Control, 10(5):447--474, 1967.
[4]
P. Hingston. Inference of regular languages using model simplicity. In ACSC '01: Proceedings of the 24th Australasian conference on Computer science, pages 69--76, Washington, DC, USA, 2001. IEEE Computer Society.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ACMSE '08: Proceedings of the 46th annual ACM Southeast Conference
March 2008
548 pages
ISBN:9781605581057
DOI:10.1145/1593105
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 28 March 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. finite automata
  2. inducing regular sets
  3. regular sets

Qualifiers

  • Research-article

Conference

ACM SE08
ACM SE08: ACM Southeast Regional Conference
March 28 - 29, 2008
Alabama, Auburn

Acceptance Rates

Overall Acceptance Rate 502 of 1,023 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 80
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media