|
|||||
|
|
Codeterministic automata on infinite words |
|
| Authors: | D Beauquier D Perrin |
| Affiliation: | L.I.T.P., Université Paris 7, 2 Place Jussieu, 75251 Paris Cedex 05, France |
| Abstract: | We prove that any recognizable set of infinite words is the infinite behaviour of some finite codeterministic automaton. |
| Keywords: | Infinite word finite automaton |
| 本文献已被 ScienceDirect 等数据库收录！ | |