-
1
-
-
0000131258
-
On a family of linear grammars
-
V. Amar, G. Putzolu, On a family of linear grammars, Inform. Control 7(3) (1964) 283-291.
-
(1964)
Inform. Control
, vol.7
, Issue.3
, pp. 283-291
-
-
Amar, V.1
Putzolu, G.2
-
2
-
-
0000106131
-
Inductive inference of formal languages from positive data
-
D. Angluin, Inductive inference of formal languages from positive data, Inform. Control 45(2) (1980) 117-135.
-
(1980)
Inform. Control
, vol.45
, Issue.2
, pp. 117-135
-
-
Angluin, D.1
-
3
-
-
84976832596
-
Inference of reversible languages
-
D. Angluin, Inference of reversible languages, J. Assoc. Comput. Machinery 29(3) (1982) 741-765.
-
(1982)
J. Assoc. Comput. Machinery
, vol.29
, Issue.3
, pp. 741-765
-
-
Angluin, D.1
-
4
-
-
84976808645
-
Data structures and algorithms for disjoint set union problems
-
Z. Galil, G.F. Italiano, Data structures and algorithms for disjoint set union problems, ACM Comput. Surveys, 23(3) (1991) 319-344.
-
(1991)
ACM Comput. Surveys
, vol.23
, Issue.3
, pp. 319-344
-
-
Galil, Z.1
Italiano, G.F.2
-
5
-
-
49949150022
-
Language identification in the limit
-
E.M. Gold, Language identification in the limit, Inform. Control 10(5) (1967) 447-474.
-
(1967)
Inform. Control
, vol.10
, Issue.5
, pp. 447-474
-
-
Gold, E.M.1
-
7
-
-
0026976841
-
Types of monotonic language learning and their characterization
-
ACM Press, New York
-
S. Lange, T. Zeugmann, Types of monotonic language learning and their characterization, in: Proc. 5th Ann. ACM Workshop on Computational Learning Theory, ACM Press, 1992, New York, pp. 377-390.
-
(1992)
Proc. 5th Ann. ACM Workshop on Computational Learning Theory
, pp. 377-390
-
-
Lange, S.1
Zeugmann, T.2
-
8
-
-
0348224259
-
-
Oxford University Press, Oxford
-
B. Lewin, Genes V, Oxford University Press, Oxford, 1994.
-
(1994)
-
-
Lewin, B.1
Genes, V.2
-
9
-
-
0010599366
-
A note on the grammatical inference problem for even linear languages
-
E. Mäkinen, A note on the grammatical inference problem for even linear languages, Fundam. Inform. 25(2) (1996) 175-181.
-
(1996)
Fundam. Inform.
, vol.25
, Issue.2
, pp. 175-181
-
-
Mäkinen, E.1
-
10
-
-
0024048494
-
Grammatical inference for even linear languages based on control sets
-
Y. Takada, Grammatical inference for even linear languages based on control sets, Inform. Processing Lett. 28(4) (1988) 193-199.
-
(1988)
Inform. Processing Lett.
, vol.28
, Issue.4
, pp. 193-199
-
-
Takada, Y.1
-
11
-
-
0010530199
-
Learning formal languages based on control sets
-
Springer, Berlin
-
Y. Takada, Learning formal languages based on control sets, Lecture Notes in Artificial Intelligence, Vol. 961, Springer, Berlin, 1995, pp. 316-339.
-
(1995)
Lecture Notes in Artificial Intelligence
, vol.961
, pp. 316-339
-
-
Takada, Y.1
-
12
-
-
0000891811
-
A hierarchy of language families learnable by regular language learning
-
Y. Takada, A hierarchy of language families learnable by regular language learning, Inform. Comput. 123(1) (1995) 138-145.
-
(1995)
Inform. Comput.
, vol.123
, Issue.1
, pp. 138-145
-
-
Takada, Y.1
-
13
-
-
0016495233
-
Efficiency of a good but not linear set union algorithm
-
R.E. Tarjan, Efficiency of a good but not linear set union algorithm, J. Assoc. Comput. Machinery 22(2) (1975) 215-225.
-
(1975)
J. Assoc. Comput. Machinery
, vol.22
, Issue.2
, pp. 215-225
-
-
Tarjan, R.E.1
|