Deciding unique decodability of bigram counts via finite automata (Q386046)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6238125
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deciding unique decodability of bigram counts via finite automata |
scientific article; zbMATH DE number 6238125 |
Statements
Deciding unique decodability of bigram counts via finite automata (English)
0 references
13 December 2013
0 references
uniqueness
0 references
sequence reconstruction
0 references
Eulerian graph
0 references
finite-state automata
0 references
0.7547221779823303
0 references
0.7142100930213928
0 references
0.7071318030357361
0 references
0.704669177532196
0 references
