kth-Order Finite Automaton

C. L. Liu · IEEE Transactions on Electronic Computers · 1963

A kth-order finite automaton is an automaton whose next state is a function of its most recent k states as well as its present input. A procedure to test whether a given ordinary automaton is equivalent to some kth-order automaton is suggested.

Read the paper · More papers on PaperTik