|
Volumn 80, Issue 2, 2014, Pages 450-456
|
Deciding unique decodability of bigram counts via finite automata
|
Author keywords
Eulerian graph; Finite state automata; Sequence reconstruction; Uniqueness
|
Indexed keywords
DECODING;
FINITE AUTOMATA;
ROBOTS;
ALPHABET SIZE;
DETERMINISTIC FINITE AUTOMATA;
EULERIAN GRAPHS;
NONDETERMINISTIC FINITE AUTOMATON;
POLYNOMIAL SIZE;
SEQUENCE RECONSTRUCTION;
UNIQUENESS;
PIPELINE PROCESSING SYSTEMS;
|
EID: 84888008419
PISSN: 00220000
EISSN: 10902724
Source Type: Journal
DOI: 10.1016/j.jcss.2013.09.003 Document Type: Article |
Times cited : (2)
|
References (13)
|