An n log n Alogrithm for Deterministic Kripke Structure Minimization
Data Structures and Algorithms
2012-05-29 v1 Formal Languages and Automata Theory
Logic in Computer Science
Abstract
We introduce an algorithm for the minimization of deterministic Kripke structures with O(kn log2 n) time complexity. We prove the correctness and complexity properties of this algorithm.
Cite
@article{arxiv.1205.5928,
title = {An n log n Alogrithm for Deterministic Kripke Structure Minimization},
author = {Karl Meinke and Muddassar A. Sindhu},
journal= {arXiv preprint arXiv:1205.5928},
year = {2012}
}
Comments
9 pages, 1 figure