Deciding unique decodability of bigram counts via finite automata

We revisit the problem of deciding by means of a finite automaton whether a string is uniquely decodable from its bigram counts. An efficient algorithm for constructing a polynomial-size Nondeterministic Finite Automaton (NFA) that decides unique decodability is given. This NFA may be simulated effi...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 80; no. 2; pp. 450 - 456
Main Authors:	Kontorovich, Aryeh, Trachtenberg, Ari
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.03.2014
Subjects:	Algorithms Eulerian graph Finite-state automata Sequence reconstruction Uniqueness Sequence reconstruction Eulerian graph Finite-state automata Uniqueness
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!