kth-Order Finite Automaton

196318 citationsJournal Article

Authors

C. L. Liu · Massachusetts Institute of Technology

Abstract

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.

Topics & Keywords

Machine Learning and Algorithms semigroups and automata theory DNA and Biological Computing

Publication Details

Published in: IEEE Transactions on Electronic Computers

Volume EC-12, Issue 5, pp. 470-475

DOI: 10.1109/pgec.1963.263628

Field-Weighted Citation Impact: 4.13

Command Palette

kth-Order Finite Automaton

Authors

Abstract

Topics & Keywords

Publication Details