What people are saying - Write a review
We haven't found any reviews in the usual places.
INFORMA TIONLOSSLESS A UTOMA TA OF FINITE ORDER AND THEIR
The inverse automaton and its construction
6 other sections not shown
admissible graph admissible set arbitrary arcs emanating assigned cleavage partitions complete trees completes the proof conditional weights contains a subtree contains an arc corresponding critical subtrees cycle decision graph defining the word Definition delay N denote disjoint of order equivalent error set Eulerian cycle exist a word Gi(A graph contains graph T(x IL-I-Af information-lossless automata initial vertex input word inverse automata inverse with delay isomorphic leaf subtrees Lemma normal automaton obtained output word pair panicle of type path of length permutation automaton principal class proof of Theorem properties residual weights root rows SA-Af satisfying conditions satisfying the conditions satisfying the following set of subtrees set of words standard inverse strongly connected strongly connected graph subgraphs attached subtree of type subtree x subtrees xi Suppose symbols T(tx transition table trees of type type I standard type II inverse word of length X(si X(Sj yield response