z-logo
open-access-imgOpen Access
Minimizing incomplete automata
Author(s) -
Marie–Pierre Béal,
Maxime Crochemore
Publication year - 2008
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - Uncategorized
Resource type - Conference proceedings
Subject(s) - automaton , alphabet , partition (number theory) , minification , partition problem , algorithm , combinatorics , dfa minimization , computer science , discrete mathematics , mathematics , deterministic automaton , quantum finite automata , automata theory , theoretical computer science , mathematical optimization , linguistics , philosophy

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here