Context-Free Recognition with Weighted Automata
Authors:
- 1 May 2000
- journal article
- Published by Springer Nature in Grammars
- Vol. 3 (2-3) , 133-150
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- The design principles of a weighted finite-state transducer libraryTheoretical Computer Science, 2000
- Semirings, Automata, Languages1986
- Transductions and Context-Free Languages1979
- Probabilistic automataInformation and Control, 1963
- On the definition of a family of automataInformation and Control, 1961
- Representation of Events in Nerve Nets and Finite Automata1956