kth-Order Finite Automaton

1963; Institute of Electrical and Electronics Engineers; Volume: EC-12; Issue: 5 Linguagem: Inglês

10.1109/pgec.1963.263628

ISSN

0367-7508

Autores

C. L. Liu,

Tópico(s)

DNA and Biological Computing

Resumo

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.

Referência(s)