Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(2)
Polynomial Time
Context Free Grammar
Related Publications
(1)
Learning OneCounter Languages in Polynomial Time (Extended Abstract)
Subscribe
Academic
Publications
Polynomialtime MAT learning of cdeterministic contextfree grammars
Polynomialtime MAT learning of cdeterministic contextfree grammars,H. Shirakawa,T. Yokomori
Edit
Polynomialtime MAT learning of cdeterministic contextfree grammars
(
Citations: 7
)
BibTex

RIS

RefWorks
Download
H. Shirakawa
,
T. Yokomori
Published in 1993.
Cumulative
Annual
Citation Context
(5)
...We will make equivalence queries where the hypothesis may not be in the learnable class – this is sometimes called an Extended Minimally Adequate Teacher [
5
]...
...Shirakawa and Yokomori [
5
] propose the following definition: A grammar G is contextdeterministic iff whenever the derivation S ∗ ⇒ lAr exists L(G, A )= {wlwr ∈ L}. This is a very interesting approach that is closely related to our own; this requirement states that for every nonterminal any of the contexts will uniquely pick out the language...
Alexander Clark
.
Distributional Learning of Some ContextFree Languages with a Minimall...
...For example the contextdeterministic languages of [
33
], are exactly context free languages where the nonterminals have the property that they correspond to concepts, and where additionally the distributions of the nonterminals are disjoint: C(M )∨C(N )= � for distinct nonterminals N and M ...
Alexander Clark
.
Three Learnable Models for the Description of Language
...Several other researchers adopted the model; see, e.g., [BR87, Ish90,
SY93
, Yok94, FR95, Fer02]...
Frank Drewes
,
et al.
Learning Deterministically Recognizable Tree Series
...researchers adopted the model to learn languages by constructing, e.g., nondeterministic finitestate automata [Yok] and restricted types of contextfree grammars [BR], [Ish2], [
SY
], [FR]...
Frank Drewes
,
et al.
Query Learning of Regular Tree Languages: How to Avoid Dead States
...The primal approach is taken in [4, 8, 13, 14, 15, 16] and the dual approach is taken in [
12
,2,5,7]...
...Among those, let us compare the learning of congruential cfgs by Clark [4] and that of cdeterministic cfgs by Shirakawa and Yokomori [
12
] as examples of those two approaches...
Ryo Yoshinaka
,
et al.
Towards Dual Approaches for Learning ContextFree Grammars Based on Sy...
Sort by:
Citations
(7)
Distributional Learning of Some ContextFree Languages with a Minimally Adequate Teacher
(
Citations: 5
)
Alexander Clark
Conference:
International Colloquium on Grammatical Inference  ICGI
, pp. 2437, 2010
Three Learnable Models for the Description of Language
(
Citations: 3
)
Alexander Clark
Published in 2010.
Learning Deterministically Recognizable Tree Series
(
Citations: 10
)
Frank Drewes
,
Heiko Vogler
Journal:
Journal of Automata, Languages and Combinatorics  JALC
, vol. 12, no. 3, pp. 332354, 2007
Query Learning of Regular Tree Languages: How to Avoid Dead States
(
Citations: 7
)
Frank Drewes
,
Johanna Högberg
Journal:
Theory of Computing Systems / Mathematical Systems Theory  MST
, vol. 40, no. 2, pp. 163185, 2007
Learning TwoTape Automata from Queries and Counterexamples
(
Citations: 5
)
Takashi Yokomori
Journal:
Theory of Computing Systems / Mathematical Systems Theory  MST
, vol. 29, no. 3, pp. 259270, 1996