Searching for "A Hierarchy of Polynomial-Time Computable Simulations for Automata." – sorted by Relevance.

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

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

1 documents found, showing 1 through 1.

A Hierarchy of Polynomial-Time Computable Simulations for Automata
by Kousha Etessami — 2002 — in Proceedings of the 13th International Conference of Concurrency Theory, CONCUR 2002, Brno, Czech Republic, 2002, Lecture Notes in Comput. Sci. 2421
…A hierarchy of polynomial-time computable simulations for automata Kousha Etessami Bell Labs…
Cited by 4 (1 self) – Add To MetaCart

Showing 1 through 1.

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