Five Determinisation Algorithms
From MaRDI portal
Publication:3602811
DOI10.1007/978-3-540-70844-5_17zbMATH Open1172.68535OpenAlexW2127450347MaRDI QIDQ3602811FDOQ3602811
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Five Determinisation Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Experimental Evaluation of Classical Automata Constructions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computation theory of cellular automata
- From bisimulation to simulation: Coarsest partition problems
- Transformational design and implementation of a new efficient solution to the ready simulation problem
- Title not available (Why is that?)
- Algebraic process verification.
- Correcting a Space-Efficient Simulation Algorithm
- The size of power automata.
Cited In (22)
- Title not available (Why is that?)
- Five-dimensional Janis–Newman algorithm
- Termination of the F5 algorithm
- Brzozowski type determinization for fuzzy automata
- Experimental Evaluation of Classical Automata Constructions
- Hierarchical information and the synthesis of distributed strategies
- An improved algorithm for determinization of weighted and fuzzy automata
- 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
- Construction of minimal deterministic finite automata from biological motifs
- Parametric random generation of deterministic tree automata
- Modifying Faugère's F5 algorithm to ensure termination
- BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS
- 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
- 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)
