Title
Families of Noncounting Languages and Their Learnability from Positive Data
Year
DOI
Venue
1996
10.1142/S0129054196000221
Int. J. Found. Comput. Sci.
Field
DocType
Volume
Discrete mathematics,Combinatorics,Subclass,Automaton,Abstract family of languages,Boolean operations in computer-aided design,Cone (formal languages),Time complexity,Learnability,Mathematics
Journal
7
Issue
Citations 
PageRank 
4
1
0.38
References 
Authors
0
2
Name
Order
Citations
PageRank
Satoshi Kobayashi11138.18
Takashi Yokomori277793.85