Smoothing and compression with stochastic k-testable tree languages
DOI10.1016/J.PATCOG.2004.03.024zbMATH Open1101.68637OpenAlexW1994904184MaRDI QIDQ2485083FDOQ2485083
Authors: Juan Ramón Rico-Juan, Jorge Calera-Rubio, Rafael C. Carrasco
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
Recommendations
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Grammars and rewriting systems (68Q42)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Language identification in the limit
- Title not available (Why is that?)
- Stochastic inference of regular tree languages
- Efficient learning of context-free grammars from positive structural examples
- Minimal Ascending and Descending Tree Automata
- Title not available (Why is that?)
- On polynomial-time learnability in the limit of strictly deterministic automata
- Locally testable languages
- Solution of an Open Problem on Probabilistic Grammars
- Disambiguating grammars by exclusion of sub-parse trees
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
- Grammatical inference of directed acyclic graph languages with polynomial time complexity
- Title not available (Why is that?)
- Efficient Statistical Modeling for the Compression of Tree Structured Intermediate Code
- Enhanced suffix arrays as language models: virtual \(k\)-testable languages
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication: Smoothing and compression with stochastic \(k\)-testable tree languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485083)