Searching for "Automata on Infinite Objects." – sorted by Relevance.
-
Complexity of Automata on Infinite Objects
- Complexity of Automata on Infinite Objects Thesis for the Degree of Doctor of Philosophy by Shmuel
- Cited by 27 (0 self) – Add To MetaCart
-
Notes on the Propositional µ-calculus: Completeness and Related Results
- : : : : : : : : : : : : : : : : : : : : : : : : : : 6 2.4 Automata on infinite objects : : : : : : : : : : : : : : : : : : : : 7 3 Tableaux, markings
- Cited by 6 (0 self) – Add To MetaCart
-
Bombay
- Introduction Automata on infinite objects (!-words) were introduced in the early 1960's by B"uchi [3
- Add To MetaCart
-
Weak Muller acceptance condition for tree automata
- ,murano,napolig@(email omitted); Abstract. Over the last decades the theory of nite automata on in- nite objects has been an important
- Cited by 3 (2 self) – Add To MetaCart
-
How Much Memory is Needed to Win Infinite Games?
- is relevant to synthesis of reactive programs and to the theory of automata on infinite objects. We provide
- Cited by 25 (2 self) – Add To MetaCart
-
Avoiding determinization
- Abstract Automata on infinite objects are extensively used in system specification, verification
- Cited by 3 (1 self) – Add To MetaCart
-
References
- Symposium on Logic in Computer Science, Paris, 1994, IEEE Press, 438-447. [19] W. Thomas, Automata on Infinite
- Add To MetaCart
-
The weakness of self-complementation
- and study of finite automata on infinite objects. Like automata on finite objects, automata on infinite
- Cited by 8 (3 self) – Add To MetaCart
-
unknown title
- . Lect. Notes in Comput. Sci., vol. 386, Springer (1989) 104-119. [25] Thomas, W.: Automata on infinite
- Add To MetaCart
-
[23] D. Peled, All from One, One for All: on Model Checking using Representatives, 5th
- -749. [31] W. Thomas, Automata on Infinite Objects, in J. Van Leeuwen (ed.), Handbook of Theoretical
- Add To MetaCart

