Polynomial-time identification of very simple grammars from positive data. (Q1874233): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inductive inference of formal languages from positive data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inference of Reversible Languages / 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: Q5181346 / 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: Q5592246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4072875 / 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: Remarks on the structural grammatical inference problem for context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associate languages and derivational complexity of formal grammars and languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a mathematical theory of machine discovery from facts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rich classes inferable from positive data: Length-bounded elementary formal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On polynomial-time learnability in the limit of strictly deterministic automata / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00423-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965255070 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:33, 30 July 2024

scientific article
Language Label Description Also known as
English
Polynomial-time identification of very simple grammars from positive data.
scientific article

    Statements

    Identifiers