scientific article; zbMATH DE number 4108165
From MaRDI portal
Publication:3832058
Recommendations
- scientific article; zbMATH DE number 4166871
- scientific article; zbMATH DE number 6300100
- scientific article; zbMATH DE number 4108164
- Minimisation of automata
- The minimization of a kind of non-deterministic finite automata
- scientific article; zbMATH DE number 2040922
- Minimizing finite automata is computationally hard
- scientific article; zbMATH DE number 1834665
- Minimization of lattice automata
- Some remarks on automata minimality
Cited in
(35)- Realization of finite-automaton algorithms by structured programs. II
- A maxmin problem on finite automata
- Sorting and doubling techniques for set partitioning and automata minimization problems
- Aggregation-based minimization of finite state automata
- Minimisation of automata
- Words of minimum rank in deterministic finite automata
- Edge-minimization of non-deterministic finite automata
- On the Transition Reduction Problem for Finite Automata
- Once more on the edge-minimization of nondeterministic finite automata and the connected problems
- Closure properties of hyper-minimized automata
- A geometrical view of the determinization and minimization of finite-state automata
- scientific article; zbMATH DE number 4166871 (Why is no real title available?)
- ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
- Building the minimal automaton of \(A ^{*} X\) in linear time, when \(X\) is of bounded cardinality
- Automata with Extremal Minimality Conditions
- scientific article; zbMATH DE number 4108164 (Why is no real title available?)
- A polynomial double reversal minimization algorithm for deterministic finite automata
- scientific article; zbMATH DE number 58314 (Why is no real title available?)
- Fast brief practical DFA minimization
- scientific article; zbMATH DE number 1955813 (Why is no real title available?)
- scientific article; zbMATH DE number 2040922 (Why is no real title available?)
- scientific article; zbMATH DE number 2081039 (Why is no real title available?)
- scientific article; zbMATH DE number 6917169 (Why is no real title available?)
- scientific article; zbMATH DE number 7199591 (Why is no real title available?)
- More on Minimizing Finite Automata with Errors — Nondeterministic Machines
- scientific article; zbMATH DE number 6300100 (Why is no real title available?)
- On Transition Minimality of Bideterministic Automata
- Minimization of finite state automata through partition aggregation
- Minimizing Generalized Büchi Automata
- Asymptotics of Minimal Deterministic Finite Automata Recognizing a Finite Binary Language
- Solution of the generalized minimization problem for two-tape automata with one fixed tape
- Minimization of automata for liveness languages
- String execution time for finite languages: max is easy, min is hard
- An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
- Minimizing finite automata is computationally hard
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3832058)
