The following pages link to Damián López (Q306710):
Displaying 22 items.
- Minimal consistent DFA revisited (Q306711) (← links)
- A polynomial double reversal minimization algorithm for deterministic finite automata (Q386994) (← links)
- Polynomial characteristic sets for \(DFA\) identification (Q442107) (← links)
- A split-based incremental deterministic automata minimization algorithm (Q905684) (← links)
- On the efficient construction of quasi-reversible automata for reversible languages (Q963387) (← links)
- On locally reversible languages (Q1034616) (← links)
- A McCulloch-Pitts neural net to characterize even linear languages (Q1350293) (← links)
- Grammatical inference of directed acyclic graph languages with polynomial time complexity (Q1747486) (← links)
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- DFA minimization: double reversal versus split minimization algorithms (Q2342683) (← links)
- Error-correcting tree language inference (Q2778081) (← links)
- EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM (Q2941086) (← links)
- On the Inference of Finite State Automata from Positive and Negative Data (Q2963595) (← links)
- Protein Motif Prediction by Grammatical Inference (Q3541858) (← links)
- Transducer Inference by Assembling Specific Languages (Q3588375) (← links)
- Identifying P Rules from Membrane Structures with an Error-Correcting Approach (Q3591020) (← links)
- (Q4536479) (← links)
- (Q4706547) (← links)
- Characterizing Membrane Structures Through Multiset Tree Automata (Q5452069) (← links)
- Structural, Syntactic, and Statistical Pattern Recognition (Q5466351) (← links)
- Membrane Computing (Q5897734) (← links)
- SUVS: secure unencrypted voting scheme (Q6486224) (← links)
