Inferring uniquely terminating regular languages from positive data (Q287033): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Inference of Reversible Languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on inferring uniquely terminating code languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Language identification in the limit / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198075 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The grammatical inference problem for the Szilard languages of linear grammars / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A family of languages which is polynomial-time learnable from positive data in pitt's sense / rank | |||
Normal rank |
Latest revision as of 01:06, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Inferring uniquely terminating regular languages from positive data |
scientific article |
Statements
Inferring uniquely terminating regular languages from positive data (English)
0 references
26 May 2016
0 references
formal languages
0 references
regular languages
0 references
grammatical inference
0 references
identification in the limit
0 references