# Finite-state machine

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2005

Highly Cited

2005

- IEEE Transactions on Information Theory
- 2005

We consider a finite-state machine channel with a finite memory length (e.g., finite length intersymbol interference channelsâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- ISSTA
- 2002

We give an algorithm that derives a finite state machine (FSM) from a given abstract state machine (ASM) specification. Thisâ€¦Â (More)

Is this relevant?

Highly Cited

2000

Highly Cited

2000

- FG
- 2000

This paper proposes a state based approach to gesture learning and recognition. Using spatial clustering and temporal alignmentâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- IEEE Trans. on CAD of Integrated Circuits andâ€¦
- 1999

This paper studies the semantics of hierarchical finite state machines (FMSâ€™s) that are composed using various concurrency modelsâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Natural Language Engineering
- 1996

Finite state cascades represent an attractive architecture for parsing unrestricted text. Deterministic parsers specified byâ€¦Â (More)

Is this relevant?

Highly Cited

1994

Highly Cited

1994

- ISSRE
- 1994

The application of the Mutation Analysis criterion in the context of specifiation based on Finite State Machine is proposed. Theâ€¦Â (More)

Is this relevant?

Highly Cited

1986

Highly Cited

1986

- ACM Trans. Program. Lang. Syst.
- 1986

We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in aâ€¦Â (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- IEEE Transactions on Computer-Aided Design ofâ€¦
- 1985

Computer-Aided synthesis of sequential functions of VLSI systems, such as microprocessor control units, must include designâ€¦Â (More)

Is this relevant?

Highly Cited

1983

Highly Cited

1983

- J. ACM
- 1983

A model of commumcations protocols based on finite-state machines is investigated. The problem addressed is how to ensure certainâ€¦Â (More)

Is this relevant?

Highly Cited

1972

Highly Cited

1972

- IEEE Transactions on Computers
- 1972

The Nerode realization technique for synthesizing finite-state machines from their associated right-invariant equivalenceâ€¦Â (More)

Is this relevant?