C. L. Liu
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.
OpenAlex reports 18 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Two-way deterministic finite automaton, Deterministic automaton, Büchi automaton, Timed automaton, Continuous automaton, Probabilistic automaton, Pushdown automaton, Nondeterministic finite automaton