307 search results - page 10 / 62 » Finite locally-quasiprimitive graphs |
CSL
2007
Springer
14 years 4 months ago
2007
Springer
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
STRINGOLOGY
2008
13 years 11 months ago
2008
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
EJC
2006
13 years 10 months ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...
EJC
2008
13 years 10 months ago
2008
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
DAC
1994
ACM
14 years 1 months ago
1994
ACM
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...