论文部分内容阅读
We consider complete deterministic finite automata(DFA)
Primitive Digraphs,Markov Chains and Synchronizing Automata
【摘 要】
：
We consider complete deterministic finite automata(DFA)
【机 构】
：
UralFederalUniversity,Ekaterinburg,Russia
【出 处】
：
2015 Workshop on Combinatorics(2015组合论学术研讨会)
【发表日期】
：
2015年5期
其他文献
Space(X;μX):Hausdorff topological spaces X equipped with astrictly positive probability measure spaces μX.
会议
Brief introduction to uniform design Background Measure of uniformity | discrepancy Combinatorial properties of uniform designs Three examples Construction meth
会议
Unit sphere Distance Euclidean distance:x,y ∈ Sd,|x-y|2 = 2(1-x·y) Geodesic distance:x,y ∈ Sd,dist(x,y) =arccos(x·y)
会议
Where I am from?Can Modern Math be Understood?"Most current mathematical research,since the 60s,is devoted to fancy situations:it brings solutions which nobody
会议
1 D-stable matrices:definition,properties and examples 1 D-stable matrices:definition,properties and examples 2 D-positive matrices
会议
Can we think of evaluating a 100-dimensional integral,I(F):= Z 1 0...Z 1 0 F(y1,...,y100)dy1 · · · dy100?Some scientists and engineers want to evaluate integ
会议
Synchronization Synchrony can be essential "Clock synchronization is a critical component in the operation of wireless sensor networks,as it provides a common t
会议
Outline:Backgroung A conjecture Bohr problem Main resuil 1.Backgroung
会议
Outline Pivot Property Dismantlable Graphs Complete Graphs The 3-coloured Chessboard Four-cycle Free Graphs and the Universal Cover Generalised Pivot Property S
会议
1.Motivation Problem in Geostatistics We want to investigate,e.g.,temperature,GH gas,magnetic eld,...Where do we have to observe these data?
会议