The following pages link to Aurélien Lemay (Q386999):
Displaying 23 items.
- Approximate membership for regular languages modulo the edit distance (Q387000) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- Learning regular languages using RFSAs. (Q1426151) (← links)
- Identification of birfsa languages. (Q2490821) (← links)
- (Q2754000) (← links)
- (Q2762501) (← links)
- Sublinear DTD Validity (Q2799222) (← links)
- Normalization of Sequential Top-Down Tree-to-Word Transducers (Q3004595) (← links)
- Learning Rational Functions (Q3167502) (← links)
- Equivalence of Deterministic Nested Word to Word Transducers (Q3183621) (← links)
- Schema-Guided Induction of Monadic Queries (Q3530183) (← links)
- Efficient Inclusion Checking for Deterministic Tree Automata and DTDs (Q3540108) (← links)
- Learning n-Ary Node Selecting Tree Transducers from Completely Annotated Examples (Q3541868) (← links)
- (Q4440387) (← links)
- (Q4452060) (← links)
- (Q4473564) (← links)
- (Q4799353) (← links)
- (Q5089205) (← links)
- Learning Sequential Tree-to-Word Transducers (Q5404938) (← links)
- (Q5405274) (← links)
- Grammatical Inference: Algorithms and Applications (Q5493009) (← links)
- Inference of shape graphs for graph databases (Q6491024) (← links)
- Inference of shape graphs for graph databases (Q6492720) (← links)
