Recommendations
Cites work
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1306878 (Why is no real title available?)
- scientific article; zbMATH DE number 798342 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- Algebraic process verification.
- Computation theory of cellular automata
- Correcting a Space-Efficient Simulation Algorithm
- Experimental Evaluation of Classical Automata Constructions
- Five Determinisation Algorithms
- From bisimulation to simulation: Coarsest partition problems
- The size of power automata.
- Transformational design and implementation of a new efficient solution to the ready simulation problem
Cited in
(27)- scientific article; zbMATH DE number 3903975 (Why is no real title available?)
- Five-dimensional Janis–Newman algorithm
- Termination of the F5 algorithm
- Brzozowski type determinization for fuzzy automata
- Experimental Evaluation of Classical Automata Constructions
- An improved algorithm for determinization of weighted and fuzzy automata
- Hierarchical information and the synthesis of distributed strategies
- Complementing Büchi Automata with Ranker
- On automaton determinisation of sets of superwords
- Random Generation of Deterministic Tree (Walking) Automata
- A New Approach to Determinisation Using Bit-Parallelism
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- On complementation of nondeterministic finite automata without full determinization
- Construction of minimal deterministic finite automata from biological motifs
- Efficient determinization of visibly and height-deterministic pushdown automata
- Parametric random generation of deterministic tree automata
- Schema-based automata determinization
- Modifying Faugère's F5 algorithm to ensure termination
- BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS
- From diagnosis of active systems to incremental determinization of finite acyclic automata
- Determinization of fuzzy automata via factorization of fuzzy states
- Implementation and Application of Automata
- Simulations in rank-based Büchi automata complementation
- Succinct determinisation of counting automata via sphere construction
- Five Determinisation Algorithms
- The reachable simulation problem
- Further improvements of determinization methods for fuzzy finite automata
This page was built for publication: Five Determinisation Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3602811)
