Learning context-free grammars from structural data in polynomial time (Q917318): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Learning regular sets from queries and counterexamples / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The minimalization of tree automata / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5668012 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The use of grammatical inference for designing programming languages / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3309084 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Complexity of automaton identification from given data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Skeletal structural descriptions / rank | |||
Normal rank | |||
Latest revision as of 09:01, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Learning context-free grammars from structural data in polynomial time |
scientific article |
Statements
Learning context-free grammars from structural data in polynomial time (English)
0 references
1990
0 references
context-free grammars
0 references
grammatical inference problem
0 references
context-free languages
0 references
Structural descriptions
0 references
unlabelled derivation trees
0 references
equivalence queries
0 references
membership queries
0 references
