MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "On the Structure of Complete Sets." – sorted by Relevance.

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

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

41 documents found, showing 1 through 10. Next 10 →

ATOM

On the Structure of Complete Sets
by Harry Buhrman, Leen Torenvliet — 1994 — In Proceedings 9th Structure in Complexity Theory
…On the structure of complete sets Harry Buhrman Leen Torenvliet Dept. Llenguatges i sist…
Cited by 24 (1 self) – Add To MetaCart

On the Structure of Complete Sets
by Harry Buhrman Leen, Harry Buhrman, Leen Torenvliet — 1994 — In Proceedings 9th Structure in Complexity Theory
…On the structure of complete sets Harry Buhrman Leen Torenvliet Dept. Llenguatges i sist…
Add To MetaCart

Splittings, Robustness and Structure of Complete Sets
by Harry Buhrman, Albrecht Hoene, Leen Torenvliet — 1993
…Splittings, Robustness and Structure of Complete Sets Harry Buhrman 1 Albrecht Hoene 2 Leen…
Cited by 14 (4 self) – Add To MetaCart

Complete Sets and Structure in Subrecursive Classes
by Harry Buhrman, Leen Torenvliet — 1998 — In Proceedings of Logic Colloquium '96
…Complete Sets and Structure in Subrecursive Classes Harry Buhrman 1 Leen Torenvliet 2 Abstract…
Cited by 12 (1 self) – Add To MetaCart

An Efficient Interactive Algorithm for Regular Language Learning
by Tr Rajesh Parekh, Rajesh Parekh, Rajesh Parekh, Rajesh Parekh, Vasant Honavar, Vasant Honavar, Vasant Honavar — 1995 — Computer Science TR95-02, Iowa State University
… for learning regular grammars. A knowledgeable teacher provides the learner with a structurally complete set…
Cited by 1 (1 self) – Add To MetaCart

An Efficient Interactive Algorithm for Regular Language Learning
by An Efficient, Interactive Algorithm, Rajesh Parekh, Rajesh Parekh, Vasant Honavar, Vasant Honavar
…. A knowledgeable teacher provides the learner with a structurally complete set of strings that belong…
Add To MetaCart

International Journal of Foundations of Computer Science cfl World Scientific Publishing Company ON THE ISOMORPHISM CONJECTURE FOR 2-DFA REDUCTIONS
by unknown authors — 1999
… Revised December 24, 1999 Communicated by J. Y. Cai ABSTRACT The degree structure of complete sets under…
Add To MetaCart

Autoreducibility, mitoticity and immunity
by Christian Glaßer, Mitsunori Ogihara, A. Pavan, Alan L. Selman, Liyu Zhang — 2005 — Mathematical Foundations of Computer Science: Thirtieth International Symposium, MFCS 2005
… and Torenvliet in their 1994 survey paper on the structure of complete sets. 1 Introduction We solve several open…
Cited by 3 (1 self) – Add To MetaCart

Efficient Learning of Regular Languages Using Teacher-Supplied Positive Samples and Learner-Generated Queries
by Tr Rajesh Parekh, Learner-generated Queries, Rajesh Parekh, Rajesh Parekh, Vasant Honavar, Vasant Honavar — 1993 — In Proceedings of the Fifth UNB Conference onAI
… with a structurally complete set of positive examples belonging to the unknown grammar G. Using…
Cited by 6 (4 self) – Add To MetaCart

Object-Oriented Design of Flexible Manufacturing Systems
by Gabriele Elia, Giuseppe Menga
… as by rules for finding "patterns" from the problem. An OO "pattern" language is a structured and complete set…
Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

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