Proceedings of the Estonian Academy of Sciences, Physics and Mathematics |
Expressions et termes fréquents
adaptive solution Algorithm arbitrary Atm(D automaton blocks Boolean function breadth-first searching column number computed condition controllability form controller canonical form corresponding cover r(X definition deleting denoted directed graph directly follows discrete mathematics disjoint submatrix disjunctive normal forms element elementary operator equal equivalent Estonian Academy Publishers extropy finite automata finite set fnl(i G X+ gnr(i go to Step graph algebras Hence implies induction integrability irreducible sets ith level l)th level languages recognized Lemma Let us define linear linearizability M-model mapping Math minimal minterms nonlinear controller one-forms partial ordering partition perfect m-subset permutation preset solutions problems of discrete procedure GRBG Proposition regular expression resolve problems root satisfied set of situations set p(S Sfin simple cover Skobelev subset 97 subtree Tallinn Tartu Theorem transformed tree T>s Ukraine undefined University of Tartu unp(i vectors vertex VF vertices vrnts(v xn G