Fundamental study
X-automata on ω-words

https://doi.org/10.1016/0304-3975(93)90349-XGet rights and content
Under an Elsevier user license
open archive

Abstract

For any storage type X, the ω-languages accepted by X-automata are investigated. Six accepting conditions (including those introduced by Landweber) are compared for X-automata. The inclusions between the corresponding six families of ω-languages are essentially the same as for finite-state automata. Apart from unrestricted automata, also real-time and deterministic automata are considered. The main tools for this investigation are: (1) a characterization of the ω-languages accepted by X-automata in terms of inverse X-transductions of finite-state ω-languages; and (2) the existence of topological upper bounds on some of the families of accepted ω-languages (independent of the storage type X).

Cited by (0)