Pages that link to "Item:Q5590818"
From MaRDI portal
The following pages link to On the State Minimization of Nondeterministic Finite Automata (Q5590818):
Displayed 28 items.
- Some more algorithms for Conway's universal automaton (Q399502) (← links)
- Nondeterministic Moore automata and Brzozowski's minimization algorithm (Q442154) (← links)
- Limitations of lower bound methods for deterministic nested word automata (Q553328) (← links)
- A lower bound technique for the size of nondeterministic finite automata (Q671381) (← links)
- Bideterministic automata and minimal representations of regular languages (Q703504) (← links)
- NFA reduction algorithms by means of regular inequalities (Q703569) (← links)
- Reduction of fuzzy automata by means of fuzzy quasi-orders (Q726556) (← links)
- A theory of ultimately periodic languages and automata with an application to time granularity (Q731330) (← links)
- On size reduction techniques for multitape automata (Q860868) (← links)
- Fuzzy relation equations and reduction of fuzzy automata (Q988575) (← links)
- Minimisation of automata (Q2074212) (← links)
- Descriptional complexity of regular languages (Q2074214) (← links)
- Yet another canonical nondeterministic automaton (Q2112192) (← links)
- Nondeterministic syntactic complexity (Q2233426) (← links)
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's (Q2271436) (← links)
- Multiheuristic approach to discrete optimization problems (Q2371698) (← links)
- Theory of átomata (Q2453119) (← links)
- On the Inference of Finite State Automata from Positive and Negative Data (Q2963595) (← links)
- Forward Bisimulations for Nondeterministic Symbolic Finite Automata (Q3303912) (← links)
- NONDETERMINISTIC FINITE AUTOMATA — RECENT RESULTS ON THE DESCRIPTIONAL AND COMPUTATIONAL COMPLEXITY (Q3395129) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- Compact Normal Form for Regular Languages as Xor Automata (Q3637338) (← links)
- Some more on the basis finite automaton (Q4981717) (← links)
- Nondeterministic Moore Automata and Brzozowski’s Algorithm (Q5200055) (← links)
- MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON (Q5704379) (← links)
- ENUMERATING NONDETERMINISTIC AUTOMATA FOR A GIVEN LANGUAGE WITHOUT CONSTRUCTING THE CANONICAL AUTOMATON (Q5714672) (← links)
- Lower Bound Methods for the Size of Nondeterministic Finite Automata Revisited (Q5739002) (← links)
- Duality of Lattices Associated to Left and Right Quotients (Q6204124) (← links)