Five Determinisation Algorithms

DOI10.1007/978-3-540-70844-5_17zbMath1172.68535OpenAlexW2127450347MaRDI QIDQ3602811

B. Ploeger, Robert J. 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)

Related Items (10)

Brzozowski type determinization for fuzzy automata ⋮ Hierarchical information and the synthesis of distributed strategies ⋮ Construction of minimal deterministic finite automata from biological motifs ⋮ Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders ⋮ Parametric random generation of deterministic tree automata ⋮ Determinization of fuzzy automata via factorization of fuzzy states ⋮ Further improvements of determinization methods for fuzzy finite automata ⋮ An improved algorithm for determinization of weighted and fuzzy automata ⋮ Five Determinisation Algorithms ⋮ Random Generation of Deterministic Tree (Walking) Automata

Cites Work

• Computation theory of cellular automata
• The size of power automata.
• From bisimulation to simulation: Coarsest partition problems
• Transformational design and implementation of a new efficient solution to the ready simulation problem
• Correcting a Space-Efficient Simulation Algorithm
• Five Determinisation Algorithms
• Experimental Evaluation of Classical Automata Constructions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Five Determinisation Algorithms