#### Filter Results:

- Full text PDF available (121)

#### Publication Year

1988

2018

- This year (2)
- Last 5 years (30)
- Last 10 years (65)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Ganesh Baliga, John Case, Sanjay Jain
- Inf. Comput.
- 1999

An index for an r.e. class of languages (by definition) is a procedure which generates a sequence of grammars defining the class. An index for an indexed family of languages (by definition) is aâ€¦ (More)

- Mark A. Fulk, Sanjay Jain, Daniel N. Osherson
- J. Comput. Syst. Sci.
- 1994

In this paper we solve some of the open problems in [19]. We also give partial solutions to some other open problems in the book. In particular we show that the collection of classes of languagesâ€¦ (More)

It is shown that the parity game can be solved in quasipolynomial time. The parameterised parity game Ã¢Â€Â“ with <i>n</i> nodes and <i>m</i> distinct values (aka colours or priorities) Ã¢Â€Â“ is proven toâ€¦ (More)

- Andris Ambainis, Sanjay Jain, Arun Sharma
- EuroCOLT
- 1997

The approach of ordinal mind change complexity, introduced by Freivalds and Smith, uses (notations for) constructive ordinals to bound the number of mind changes made by a learning machine. Thisâ€¦ (More)

- Sanjay Jain, Arun Sharma
- J. Comput. Syst. Sci.
- 1996

A new investigation of the complexity of language identification is undertaken using the notion of reduction from recursion theory and complexity theory. The approach, referred to as the intrinsicâ€¦ (More)

- John Fearnley, Sanjay Jain, Sven Schewe, Frank Stephan, Dominik Wojtczak
- SPIN
- 2017

Parity games play an important role in model checking and synthesis. In their paper, Calude et al. have recently shown that these games can be solved in quasi-polynomial time. We show that theirâ€¦ (More)

- Sanjay Jain, Carl H. Smith, Rolf Wiehagen
- COLT
- 1998

1 Introduction Intuitively, a class of objects is robustly learn-able if not only this class itself is learnable but all of its computable transformations do remain learnable as well. In that sense,â€¦ (More)

- Sanjay Jain, Efim B. Kinber
- ALT
- 2006

A number of natural models for learning in the limit is introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a part of the targetâ€¦ (More)

- John Case, Sanjay Jain, Steffen Lange, Thomas Zeugmann
- Inf. Comput.
- 1999

Important refinements of concept learning in the limit from positive data considerably restricting the accessibility of input data are studied. Let c be any concept; every infinite sequence ofâ€¦ (More)

- John Case, Sanjay Jain
- ALT
- 1998

An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of recursive languages (by definition) generates a sequenceâ€¦ (More)