Minimization of unary symmetric difference NFAs
暂无分享,去创建一个
We investigate the minimization of unary symmetric difference nondeterministic finite automata. To this end, we develop a modification of the Berlekamp-Massey algorithm. We then prove that, given a unary symmetric difference nondeterministic finite automaton with one final state, this modified algorithm produces a minimal symmetric difference nondeterministic finite automaton which accepts the same language. We also discuss the application of the technique in the case where the nondeterministic finite automaton has more than one final state.
[1] Lynette van Zijl,et al. Random Number Generation with +-NFAs , 2001, CIAA.
[2] James L. Massey,et al. Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.
[3] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.
[4] Janusz A. Brzozowski,et al. Derivatives of Regular Expressions , 1964, JACM.
[5] Larry L. Dornhoff,et al. Applied Modern Algebra , 1978 .