𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Context-Free Recognition with Weighted Automata

✍ Scribed by Corinna Cortes; Mehryar Mohri

Book ID
110282882
Publisher
Springer
Year
2000
Tongue
English
Weight
197 KB
Volume
3
Category
Article
ISSN
1572-848X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Simulating finite automata with context-
Simulating finite automata with context-free grammars
✍ Michael Domaratzki; Giovanni Pighizzini; Jeffrey Shallit πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 78 KB

We consider simulating finite automata (both deterministic and nondeterministic) with context-free grammars in Chomsky normal form (CNF). We show that any unary DFA with n states can be simulated by a CNF grammar with O(n 1/3 ) variables, and this bound is tight. We show that any unary NFA with n st

Forgetting automata and context-free lan
Forgetting automata and context-free languages
✍ Petr Jančar; FrantiΕ‘ek MrΓ‘z; Martin PlΓ‘tek πŸ“‚ Article πŸ“… 1996 πŸ› Springer-Verlag 🌐 English βš– 716 KB
Weighted automata with discounting
Weighted automata with discounting
✍ Manfred Droste; Jacques Sakarovitch; Heiko Vogler πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 170 KB