Weighted context free grammars and weighted finite automata were initially introduced in significant articles by Marcel-Paul Schutzenberger (1961) and Noam Chomsky (1963), respectively. Weighted finite automata are standard nondeterministic finite automata in which the transitions have weights.