Name
Abstract | ||
|---|---|---|
We consider transducers over infinite words with a Büchi or a Muller
acceptance condition. We give characterizations of functions that can be
realized by Büchi and Muller sequential transducers. We describe an
algorithm to determinize transducers defining functions over infinite
words.
|
Year | DOI | Venue |
|---|---|---|
2004 | https://doi.org/10.1007/s00224-003-1014-9 | Theory of Computing Systems |
Keywords | Field | DocType |
Acceptance Condition,Infinite Word,Sequential Transducer | Discrete mathematics,Mathematics | Journal |
Volume | Issue | ISSN |
37 | 4 | 1432-4350 |
Citations | PageRank | References |
3 | 0.50 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marie-pierre Béal | 1 | 327 | 35.73 |
| Olivier Carton | 2 | 381 | 40.97 |