What people are saying - Write a review
We haven't found any reviews in the usual places.
in finite automata
Supplementary material problems examples
10 other sections not shown
Other editions - View all
absolute black boxes accessible from q0 arbitrary autom automata automata theory automaton 9Ji automaton graph automaton representing behavior black box 9Ji co-regular expression concatenation consider contains control function corresponding cylindrification decision problem definition degree of distinguishability degree of reconstructibility denote diagram edges issuing effectively construct empty word equivalent example exists Figure finite automaton finite tree finite-state languages finite-state operator given grammar graph G I-formula identifies absolute black infinite input alphabet input word iterative algorithm language 91 languages co-languages Lemma limit macrostate linear grammar metalanguage multiple multiple algorithms natural number nonanticipatory operator output alphabet output labels output words pairwise predicate variables probabilistic automaton proof prove regular expression relative black boxes representable residually distinguishes satisfies the inequality Section sequence signaling function source macrosource stochastic procedure symbols synthesis problem Theorem Trakhtenbrot uniformly with frequency upper bound vertex vertices weight winning strategy words of length
All Book Search results »
Formal Methods for Protocol Engineering and Distributed Systems: Forte XII ...
Jianping Wu,Samuel T. Chanson,Quiang Gao
No preview available - 1999