## 31 Citations

A comparison of the work done by generalized sequential machines and Turing machines

- Mathematics
- 1962

For a long time it has been accepted that Turing machines are more powerful than generalized sequential machines. Since a generalized sequential machine is also a Turing machine, the class of Turing…

Minimization and Synthesis of the Tail inSequential Compositions of Mealy Machines

- Computer ScienceArXiv
- 2021

This work considers a system consisting of a sequential composition of Mealy machines, called head and tail, and introduces a minimization method for this context which yields an exponential improvement over the state of the art.

MEMIN: SAT-based exact minimization of incompletely specified Mealy machines

- Computer Science2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
- 2015

On a number of hard benchmarks, this approach outperforms existing exact minimization techniques by several orders of magnitude; it is even competitive with state-of-the-art heuristic approaches on most benchmarks.

Minimization of mealy finite-state machines by internal states gluing

- Mathematics
- 2012

A problem of minimization of Mealy finite-state machines that is common in synthesizing digital devices on programmable logic devices is considered. The proposed approach uses an operation of gluing…

Minimization of Moore finite automata by internal state gluing

- Mathematics
- 2010

A method for minimization of Moore finite automata based on the operation of gluing two states and on the represention of a finite automaton in the form of a transition list is considered. Conditions…

Zur Theorie endlicher Automaten

- Computer ScienceComputing
- 2005

The following paper is not to deal with linguistic aspects of automata but with those aspects complementary herewith, if one intends to describe and to classify various types of Automata.

Minimal coverings for incompletely specified sequential machines

- Mathematics, Computer ScienceActa Informatica
- 2004

An algebraic treatment of the problem of finding minimal realizations for incompletely specified machines is developed and a homomorphic characterization of the covering-relation is given, which is characterized as a special morphism.

Finite state machine design

- Computer Science
- 2003

This paper designs a finite-state machine with a 1-bit input, perfectgpa, and a1-bit output, shred, which is 1 when the input resume should be shredded.

Fault coverage analysis in respect to an FSM specification

- Computer ScienceProceedings of INFOCOM '94 Conference on Computer Communications
- 1994

The problem of deciding if a test suite generated from a finite state machine provides complete fault coverage can be converted into the problem of minimizing the test tree representing the test suite, and a fault coverage analysis procedure is developed.

Design of synchronous sequential circuits

- Computer Science
- 1992

This chapter examined the design of counter circuits, since these provide a welldefined logic design problem in that the coding of the circuit states is normally explicit in the specification and there are few (if any) primary data inputs to complicate the construction of the state transition table.

## References

SHOWING 1-8 OF 8 REFERENCES

A Synthesis Technique for Minimal State Sequential Machines

- Computer ScienceIRE Trans. Electron. Comput.
- 1959

A method is presented which always yields a minimal state sequential machine satisfying a prescribed finite set of input-output sequences. An application is made to the case where a given sequential…

Gedanken-Experiments on Sequential Machines, in Automata Studies

- Gedanken-Experiments on Sequential Machines, in Automata Studies
- 1956

A method for synthesizing sequential circuits

- Computer Science
- 1955

A new method of synthesis is developed which emphasizes formal procedures rather than the more familiar intuitive ones, and familiarity is assumed with the use of switching algebra in the synthesis of combinational circuits.

HoI-IN, Oriented Graphs and Sequential Machines

- Bell Laboratory Report
- 1954

Suppose that X(ql, 11 @BULLET @BULLET @BULLET I~_1 Is @BULLET @BULLET -It) exists. Then X(v~

- @BULLET @BULLET @BULLET It)