| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438623 | Theoretical Computer Science | 2006 | 10 Pages |
Abstract
The two determinization procedures of Safra and Muller–Schupp for Büchi automata are compared, based on an implementation in a program called OmegaDet.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
