Five Determinisation Algorithms

Authors:
Rob Glabbeek;Bas Ploeger
Affiliations:
National ICT Australia, Sydney, Australia NSW1466 and School of Computer Science and Engineering, The University of New South Wales, Sydney, Australia NSW 2052;Department of Mathematics and Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 MB
Venue:
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Year:
2008

Citing 11
Cited 5

Transformational design and implementation of a new efficient solution to the ready simulation problem

Science of Computer Programming
A new kind of science

A new kind of science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Concurrency and Automata on Infinite Sequences

Proceedings of the 5th GI-Conference on Theoretical Computer Science
Checking for Language Inclusion Using Simulation Preorders

CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
The size of power automata

Theoretical Computer Science - Mathematical foundations of computer science
Computing simulations on finite and infinite graphs

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
From Bisimulation to Simulation: Coarsest Partition Problems

Journal of Automated Reasoning
Correcting a Space-Efficient Simulation Algorithm

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Experimental evaluation of classical automata constructions

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning

Random Generation of Deterministic Tree (Walking) Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Parametric random generation of deterministic tree automata

Theoretical Computer Science
Graph-based traceability: a comprehensive approach

Software and Systems Modeling (SoSyM)
Construction of minimal deterministic finite automata from biological motifs

Theoretical Computer Science
An improved algorithm for determinization of weighted and fuzzy automata

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Determinisation of nondeterministic finite automata is a well-studied problem that plays an important role in compiler theory and system verification. In the latter field, one often encounters automata consisting of millions or even billions of states. On such input, the memory usage of analysis tools becomes the major bottleneck. In this paper we present several determinisation algorithms, all variants of the well-known subset construction, that aim to reduce memory usage and produce smaller output automata. One of them produces automata that are already minimal. We apply our algorithms to determinise automata that describe the possible sequences appearing after a fixed-length run of cellular automaton 110, and obtain a significant improvement in both memory and time efficiency.