The most probable string: an algorithmic study

DOI10.1093/logcom/exs049zbMath1286.68299OpenAlexW1925821903MaRDI QIDQ5415366

Colin de la Higuera, Jose Oncina

Publication date: 12 May 2014

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ab73c1dca8ba339ddc6618d348e15f70a2417890

zbMATH Keywords

parsingprobabilistic automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Randomized algorithms (68W20)

Related Items (2)

Computing the Expected Edit Distance from a String to a Probabilistic Finite-State Automaton ⋮ Computing the Expected Edit Distance from a String to a PFA

This page was built for publication: The most probable string: an algorithmic study