Searching for "Polynomial Size Test Sets for Context-Free Languages." – 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.

The Complexity of the Morphism Equivalence Problem for Context-Free Languages
by Wojciech Plandowski, Prof Wojciech Rytter — 1995
… problem for those languages. The problem of existence of polynomial size test sets for context-free…
Cited by 3 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB