Learning deterministic context free grammars: the Omphalos competition (Q2384127): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the computational complexity of approximating distributions by probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NTS languages are deterministic and congruential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NTS grammars and Church-Rosser systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning deterministic regular grammars from stochastic samples in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093192 / 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: Algorithms and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on Strings, Trees and Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary induction of stochastic context free grammars / 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: Q4386970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the learnability and usage of acyclic probabilistic finite automata / 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: Grammatical Inference: Algorithms and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing derivation trees of context-free grammars through a generalization of finite automata theory / rank
 
Normal rank

Latest revision as of 08:57, 27 June 2024

scientific article
Language Label Description Also known as
English
Learning deterministic context free grammars: the Omphalos competition
scientific article

    Statements

    Learning deterministic context free grammars: the Omphalos competition (English)
    0 references
    0 references
    20 September 2007
    0 references
    grammatical inference
    0 references
    context-free languages
    0 references
    NTS languages
    0 references

    Identifiers