Name
Title | Citations | PageRank | Year |
|---|---|---|---|
| Algorithms for Learning Finite Automata from Queries: A Unified View | 32 | 1.50 | 1997 |
| An optimal parallel algorithm for learning DFA | 8 | 0.63 | 1996 |
| On non-uniform polynomial space | 4 | 0.72 | 1986 |
| Uniform characterizations of non-uniform complexity measures | 5 | 0.80 | 1985 |
| On some "non-uniform" complexity measures | 4 | 0.58 | 1985 |
| Examples of CFI-BI-immune and CF-levelable sets in logspace | 0 | 0.34 | 1985 |
| Some results about Logspace complexity measures | 0 | 0.34 | 1984 |