DocumentCode
696908
Title
Reduction factors in finite automata with application to nonlinear filters
Author
Niemisto, Antti ; Yli-Harja, Olli ; Valmari, Antti ; Koivisto, Pertti ; Shmulevich, Ilya
Author_Institution
Signal Processing Laboratory, Tampere University of Technology, P.O. Box 553, Tampere, Finland
fYear
2000
fDate
4-8 Sept. 2000
Firstpage
1
Lastpage
4
Abstract
We examine the reduction factors achieved in finite automata describing several important classes of stack filters. It has been shown that finite automata and Markov Chain theory can be used to compute certain statistical properties of stack filters. However, if the automaton is not state-minimal, the solution may be intractable, which is the motivation for this work. Formulae for the number of states in state-minimal automata are presented.
Keywords
Automata; Electric breakdown; Limiting; Markov processes; Solids; Standards;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing Conference, 2000 10th European
Conference_Location
Tampere, Finland
Print_ISBN
978-952-1504-43-3
Type
conf
Filename
7075754
Link To Document