On state reduction of incompletely specified finite state machines-Reference-Cited by-同舟云学术

On state reduction of incompletely specified finite state machines

Published:2007-01 Issue:1 Volume:33 Page:58-69
ISSN:0045-7906
Container-title:Computers & Electrical Engineering
language:en
Short-container-title:Computers & Electrical Engineering

Author:

Gören Sezer,Ferguson F. Joel

Publisher

Elsevier BV

Subject

Electrical and Electronic Engineering,General Computer Science,Control and Systems Engineering

Reference15 articles.

1. The synthesis of sequential switching circuits;Huffmann;J Franklin Institute,1954

2. Hopcroft JE. NlogN algorithm for minimizing states in finite automata. Tech Rep, Stanford University 1971; CS 71/190.

3. State reduction in incompletely specified finite state machines;Pfleeger;IEEE Trans Comput,1973

4. Minimizing the number of states in incompletely specified sequential switching functions;Paull;IRE Trans Electron Comput,1959

5. Extending the definition of prime compatibility classes of states in incompletely specified flow tables with the help of prime closed sets;Luccio;IEEE Trans Electron Comput,1969

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Mealy-machine reduction functions of Spot;Science of Computer Programming;2023-08

2. Dissecting ltlsynt;Formal Methods in System Design;2023-07-14

3. Survey on applications of algebraic state space theory of logical systems to finite state machines;Science China Information Sciences;2022-12-23

4. State Merging and Splitting Strategies for Finite State Machines Implemented in FPGA;Applied Sciences;2022-08-14

5. Diagnosability of fault patterns with labeled stochastic Petri nets;Information Sciences;2022-05