On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States.
Sven De FeliceCyril NicaudPublished in: Developments in Language Theory (2014)
Keyphrases
- space complexity
- computational complexity
- dynamic programming
- small number
- learning algorithm
- objective function
- computational cost
- worst case
- detection algorithm
- k means
- optimal solution
- deterministic automata
- database
- memory requirements
- matching algorithm
- classification algorithm
- input data
- state space
- np hard
- metadata
- databases