Entry Sakakibara:1990:LCF from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Sakakibara:1990:LCF,
author = "Y. Sakakibara",
title = "Learning context-free grammars from structural data in
polynomial time",
journal = j-THEOR-COMP-SCI,
volume = "76",
number = "2-3",
pages = "223--242",
day = "21",
month = nov,
year = "1990",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Int. Inst. for Adv. Study of Social Inf. Sci., Fujitsu
Ltd., Shizuoka, Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; context-free grammars;
correct grammar; efficient algorithm; equivalent;
frontier-to-root tree automaton; learning protocol;
minimally adequate teacher; polynomial time; query
types; structural data; structural descriptions;
structural equivalence queries; structural membership
queries; unknown grammar; unlabelled derivation trees",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- adequate,
99(1)1
- automaton,
78(2)363,
79(1)151,
84(2)281,
88(1)117,
88(2)231,
91(1)57,
92(1)119,
92(1)181,
92(2)249,
93(2)227,
95(1)159,
96(2)305,
97(2)233,
97(2)245,
98(2)347,
106(1)61,
108(1)83,
115(2)391,
116(2)305,
116(2)373,
119(2)233,
120(2)197,
123(2)199,
125(2)243,
125(2)315,
131(2)295,
134(1)253,
134(2)387,
136(2)291
- correct,
94(2)335,
100(1)157,
129(2)279
- derivation,
80(2)153,
83(1)71,
83(1)131,
90(1)235,
105(1)129,
109(1)49,
109(1)123,
113(2)259,
115(2)359,
127(1)1
- description,
71(1)133,
79(1)163,
90(1)171,
96(2)285,
104(2)285,
114(1)63,
117(1)255,
120(2)197
- efficient,
71(1)95,
74(3)299,
77(3)291,
78(1)245,
80(1)53,
91(1)1,
91(1)57,
99(2)265,
106(1)21,
108(2)331,
116(1)195,
116(2)305,
119(2)247,
129(2)293,
130(1)203,
133(2)361,
134(2)493
- equivalent,
71(2)241,
71(3)281,
82(2)341,
91(1)101,
93(2)303,
118(2)231,
127(1)99,
131(2)331
- learning,
86(2)377,
95(1)97,
100(1)157,
104(2)207,
119(2)363,
127(2)351,
133(2)387
- membership,
78(1)159,
84(2)225,
87(2)287,
92(2)249,
104(2)185,
106(2)327,
109(1)83,
111(1)211,
132(1)85,
132(1)243,
134(2)365
- protocol,
84(1)23,
95(1)169,
108(2)291,
125(1)17,
128(1)63,
128(1)127,
129(1)1,
132(1)291,
134(2)545
- query,
72(2)147,
73(2)213,
73(3)249,
74(1)95,
76(1)3,
76(1)93,
77(3)291,
78(1)3,
78(1)137,
78(1)159,
78(1)217,
78(1)z,
82(1)51,
83(2)313,
84(2)199,
85(1)75,
86(1)35,
87(2)263,
93(2)201,
97(1)143,
101(1)143,
104(2)207,
116(1)33,
116(1)59,
116(1)95,
116(1)117,
116(1)151,
116(1)195,
116(2)359,
120(1)45,
129(2)397,
130(1)139,
133(2)267,
133(2)421,
134(2)287
- structural,
71(1)79,
71(2)241,
82(1)131,
82(2)403,
93(2)185,
96(1)73,
109(1)257,
110(1)145,
113(2)349,
114(1)93,
115(1)107,
122(1)137,
129(2)279,
132(1)337,
135(2)377
- unknown,
130(1)17,
130(1)49,
130(1)125