| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10333723 | Journal of Logical and Algebraic Methods in Programming | 2016 | 21 Pages |
Abstract
Our results use an alternative automata construction, inspired by the one from Bloom, Ãsik and Stefanescu. We relate those two constructions by exhibiting a bisimulation between the resulting deterministic automata, and by showing how our construction results in more sharing between states, thus producing smaller automata.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Paul Brunet, Damien Pous,