Five Determinisation Algorithms

DOI10.1007/978-3-540-70844-5_17MaRDI QIDQ3602811zbMATH OpenOpenAlexFDO

Authors B. Ploeger, Rob van Glabbeek

Publication date 12 February 2009

Published in Implementation and Applications of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70844-5_17

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Fast brief practical DFA minimization
• A New Approach to Determinisation Using Bit-Parallelism
• BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS
• scientific article; zbMATH DE number 1309169
• scientific article; zbMATH DE number 3903975

Cites work

• 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
• 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?)
• The size of power automata.
• Transformational design and implementation of a new efficient solution to the ready simulation problem

Cited in

(27)

• Hierarchical information and the synthesis of distributed strategies
• Efficient determinization of visibly and height-deterministic pushdown automata
• Parametric random generation of deterministic tree automata
• Termination of the F5 algorithm
• Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
• Brzozowski type determinization for fuzzy automata
• From diagnosis of active systems to incremental determinization of finite acyclic automata
• Five-dimensional Janis–Newman algorithm
• A New Approach to Determinisation Using Bit-Parallelism
• Five Determinisation Algorithms
• Random Generation of Deterministic Tree (Walking) Automata
• scientific article; zbMATH DE number 3903975 (Why is no real title available?)
• Determinization of fuzzy automata via factorization of fuzzy states
• Modifying Faugère's F5 algorithm to ensure termination
• Experimental Evaluation of Classical Automata Constructions
• On automaton determinisation of sets of superwords
• An improved algorithm for determinization of weighted and fuzzy automata
• BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS
• Implementation and Application of Automata
• Schema-based automata determinization
• Construction of minimal deterministic finite automata from biological motifs
• Complementing Büchi Automata with Ranker
• Simulations in rank-based Büchi automata complementation
• Succinct determinisation of counting automata via sphere construction
• Further improvements of determinization methods for fuzzy finite automata
• On complementation of nondeterministic finite automata without full determinization
• The reachable simulation problem

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)