The following pages link to (Q4216056):
Displaying 10 items.
- A method for minimizing Moore finite-state machines by merging two states (Q384661) (← links)
- Deterministic automata. Simulation, universality and minimality (Q1377610) (← links)
- Minimization of Mealy finite-state machines by using the values of the output variables for state assignment (Q1745748) (← links)
- Modeling and analyzing finite state automata in the finite field \(F_{2}\) (Q1826593) (← links)
- On the number of special feedback configurations in linear modular systems (Q2454059) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- Limits of exact algorithms for inference of minimum size finite state machines (Q3556979) (← links)
- Partial Projection of Sets Represented by Finite Automata, with Application to State-Space Visualization (Q3618581) (← links)
- (Q4256110) (← links)
- Finite State Automata Resulting from Temporal Information Maximization and a Temporal Learning Rule (Q5703546) (← links)
