1963•IEEE Transactions on Electronic ComputersRequires access

Determination of the Final State of an Automaton Whose Initial State Is Unknown

C. L. Liu

Abstract

Methods are developed to illustrate whether or not it is possible to determine the final state of a finite automaton when 1) the initial state of the automaton is unknown and the input sequence and its corresponding output sequence are given and 2) both the initial state and the input sequence are unknown and only the output sequence is given.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Sequence (biology), Automaton, Büchi automaton, Deterministic automaton, State (computer science), Two-way deterministic finite automaton, Timed automaton, Finite-state machine