An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Computing the Rabin index of a regular language of infinite words
Information and Computation
Finite-State Language Processing
Finite-State Language Processing
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Ensembles reconnaissables de mots biinfinis
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Infinite sequences and finite machines
SWCT '63 Proceedings of the 1963 Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design
Deciding whether the frontier of a regular tree is scattered
Fundamenta Informaticae
Journal of Computer and System Sciences
Logic and rational languages of words indexed by linear orderings
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Reasoning about transfinite sequences
ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A kleene theorem for languages of words indexed by linear orderings
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Controller synthesis and ordinal automata
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
| Hi-index | 0.00 |
In a preceding paper, automata have been introduced for words indexed by linear orderings. These automata are a generalization of automata on transfinite words introduced by B眉chi. In this paper, we show that if only words indexed by scattered linear orderings are considered, the accessibility and the emptiness in these automata can be checked in time nm2 where n and m are the number of states and the number of transitions. This solves the problem for automata on transfinite words.