The following pages link to Rafael C. Carrasco (Q207958):
Displaying 22 items.
- Computing the relative entropy between regular tree languages (Q293468) (← links)
- A similarity between probabilistic tree languages: Application to XML document families. (Q1400519) (← links)
- Incremental construction of minimal tree automata (Q2391189) (← links)
- Smoothing and compression with stochastic \(k\)-testable tree languages (Q2485083) (← links)
- (Q2754017) (← links)
- Finite-state computation in analog neural networks: Steps towards biologically plausible models? (Q2768950) (← links)
- Generalized biwords for bitext compression and translation spotting (Q2887080) (← links)
- An Implementation of Deterministic Tree Automata Minimization (Q3503900) (← links)
- A perfect hashing incremental scheme for unranked trees using pseudo-minimal automata (Q3653096) (← links)
- Learning deterministic regular grammars from stochastic samples in polynomial time (Q4256139) (← links)
- Accurate computation of the relative entropy between stochastic regular grammars (Q4385674) (← links)
- Incremental Construction and Maintenance of Minimal Finite-State Automata (Q4406659) (← links)
- (Q4440398) (← links)
- (Q4536490) (← links)
- (Q4536521) (← links)
- (Q4808927) (← links)
- A note on the Nagendraprasad-Wang-Gupta thinning algorithm (Q4840362) (← links)
- Normalization of edit sequences for text synchronization (Q5198935) (← links)
- Stochastic inference of regular tree languages (Q5945687) (← links)
- Gravitation from optimized computation: Einstein and beyond (Q6056987) (← links)
- New families of scale separated vacua (Q6142668) (← links)
- Lorentzian threads and generalized complexity (Q6555801) (← links)
