DFA minimization

Known as: Automaton minimization, Minimal automaton, Minimizing deterministic finite automaton 
In automata theory (a branch of computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
In this paper, we show the relationship between the two most widely used approaches for the minimization of deterministic finite… (More)
Is this relevant?
Highly Cited
2014
Highly Cited
2014
Symbolic Automata extend classical automata by using symbolic alphabets instead of finite ones. Most of the classical automata… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 5
  • figure 4
Is this relevant?
2012
2012
Article history: Received 27 May 2011 Received in revised form 2 December 2011 Accepted 5 December 2011 Available online 7… (More)
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
2009
2009
Algorithms for learning a minimal separating DFA of two disjoint regular languages have been proposed and adapted for different… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2008
2008
We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2003
2003
In this paper, we present a new Deterministic Finite Automata (DFA) minimization algorithm. The algorithm is incremental – it may… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 3
Is this relevant?
2002
2002
In this paper, we have considered the state minimization problem for Deterministic Finite Automata (DFA). An efficient parallel… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In order to monitor a region for traffic traversal, sensors can be deployed to perform collaborative target detection. Such a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The minimum consistent DFA problem is that of finding a DFA with as few states as possible that is consistent with a given sample… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1965
Highly Cited
1965
a n d A ~ . A 2 ( = {ff'C X * : f ~ A 1 ; f ' E A2}) belong to Q. With different notations, Q has been studied in Trahtenbrot… (More)
Is this relevant?