Cyclic Nontrivial SCCs DFA Minimization

Given an finite deterministic automaton (DFA) from a class CC of DFAs, whose nontrivial SCCs are cyclic, determine its minimal automaton given by the equivalence relation on states.

Parameters

  • nn: number of states
  • dd: number of transitions
  • kk: size of alphabet

Related Problems

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 1 of 1 algorithms

See more
Almeida & Zeitoun2008O(n)O(n)O(n)O(n)

Reductions Table

Insuffient Data to display table

Other relevant algorithms

Insuffient Data to display table