Searching for "Determinizing Asynchronous Automata." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

3 documents found, showing 1 through 3.

Determinizing Asynchronous Automata
by Nils Klarlund, Madhavan Mukund, Milind Sohoni — 1993 — Proceedings of the 21st International Colloquium on Automata, Languages and Programming (ICALP'94), Jerusalem (Israel) 1994, number 820 in Lecture
…Determinizing Asynchronous Automata Nils Klarlund Madhavan Mukund y Milind Sohoni y Oktober…
Cited by 8 (2 self) – Add To MetaCart

Determinizing Asynchronous Automata on Infinite Inputs
by Nils Klarlund, Nils Klarlund, Madhavan Mukund, Madhavan Mukund, Milind Sohoni, Milind Sohoni — 1995 — Appears in Thiagarajan, editor, Foundations of Software Technology and Theoretical Computer Science: 15th Conference, FST&TCS '95 Proceedings, LNCS 1026
…BRICS Basic Research in Computer Science Determinizing Asynchronous Automata on Infinite Inputs…
Cited by 1 (0 self) – Add To MetaCart

On the complementation of asynchronous cellular Büchi automata
by Anca Muscholl — 1996 — Theoretical Computer Science
… be significant and determine their practical use. Asynchronous automata seem to be more advantageous, since…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 3.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB