LARS: a learning algorithm for rewriting systems (Q2384128): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10994-006-9593-8 / rank
Normal rank
 
Property / author
 
Property / author: Colin de la Higuera / rank
Normal rank
 
Property / author
 
Property / author: Colin de la Higuera / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: EMILE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10994-006-9593-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2122061778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical inference: Algorithms and applications. 6th international colloquium, ICGI 2002, Amsterdam, the Netherlands, September 23--25, 2002. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the relative entropy between regular tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical inference and applications. 2nd international colloquium, ICGI-94, Alicante, Spain, September 21-23, 1994. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic inference of regular tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three models for the description of language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characteristic sets for polynomial grammatical inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the inference of minimum size DFAs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prefix grammars: An alternative characterization of the regular languages / 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: On the complexity of teaching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inference of tree languages from finite samples: An algebraic approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2714262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Church-Rosser Thue systems and formal languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Term Rewriting and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental learning of context free grammars based on bottom-up parsing and search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical Inference: Algorithms and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4440398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning context-free grammars from structural data in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient learning of context-free grammars from positive structural examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent advances of grammatical inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm testing partial confluence of basic semi-Thue systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical Inference: Algorithms and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammatical inference for even linear languages based on control sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time identification of very simple grammars from positive data. / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10994-006-9593-8 / rank
 
Normal rank

Latest revision as of 08:00, 18 December 2024

scientific article
Language Label Description Also known as
English
LARS: a learning algorithm for rewriting systems
scientific article

    Statements

    LARS: a learning algorithm for rewriting systems (English)
    0 references
    0 references
    0 references
    20 September 2007
    0 references
    learning context-free languages
    0 references
    rewriting systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers