Information-lossless Automata of Finite Order |
Common terms and phrases
a₁ admissible graph Algorithm arbitrary arcs emanating assigned b₁ b₂ cleavage partitions complete trees completes the proof conditional weights contains a subtree corresponding critical subtrees cycle decision graph defining the word Definition delay N denote disjoint of order equivalent error set Eulerian cycle exist a word G₁ graph contains ILS-I-N information-lossless automata initial vertex input word inverse automata inverse with delay isomorphic leaf subtrees Lemma letter level vertices M₁ N₁ N₂ normal automaton obtained output word pair panicle of type principal class proof of Theorem properties residual weights root rows S₁ SA-M satisfying conditions set of subtrees set of words ẞi standard inverse strongly connected strongly connected graph subgraphs attached subtree of type subtree x subtrees yi Suppose symbols t₁ T₁(x Theorem transition table trees of type type I inverse type I standard word of length word ẞ yield response