Smoothing and compression with stochastic \(k\)-testable tree languages
From MaRDI portal
Publication:2485083
DOI10.1016/j.patcog.2004.03.024zbMath1101.68637MaRDI QIDQ2485083
Jorge Calera-Rubio, Rafael C. Carrasco, Juan Ramón Rico-Juan
Publication date: 3 August 2005
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10045/14022
68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)
68Q42: Grammars and rewriting systems
Related Items
Uses Software
Cites Work
- Efficient learning of context-free grammars from positive structural examples
- On polynomial-time learnability in the limit of strictly deterministic automata
- Disambiguating grammars by exclusion of sub-parse trees
- Locally testable languages
- Solution of an Open Problem on Probabilistic Grammars
- Minimal Ascending and Descending Tree Automata
- Language identification in the limit
- Stochastic inference of regular tree languages
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item