Titlebook: Automata, Languages and Programming; 33rd International C Michele Bugliesi,Bart Preneel,Ingo Wegener Conference proceedings 2006 Springer-V

Inflamed

HOWL

On Counting Homomorphisms to Directed Acyclic Graphsdigraphs ., the problem is in P and for the rest of the digraphs . the problem is #P-complete. An interesting feature of the dichotomy, absent from related dichotomy results, is the rich supply of tractable graphs . with complex structure.

jabber

Nucleate

inspiration

OTHER

Stopping Times, Metrics and Approximate Countingmetric which allows us to analyse a one-step path coupling. This approach provides insight for the design of better metrics for specific problems. We give illustrative applications to hypergraph independent sets and SAT instances, hypergraph colourings and colourings of bipartite graphs, obtaining improved results for all these problems.

CLASP

Algebraic Characterization of the Finite Power Propertyonoids defined by a confluent regular system of deletion rules. This result in particular covers the case of free groups solved earlier by d’Alessandro and Sakarovitch by means of an involved reduction to the boundedness problem for distance automata.

Senescent

Expressive Power of Pebble Automatac (resp. deterministic) tree-walking automata with . + 1 pebbles can recognize more languages than those with . pebbles. Moreover, there is a regular tree language that is not recognized by any tree-walking automaton with pebbles. As a consequence, FO+posTC is strictly included in MSO over trees.

acquisition

conference

Handbuch der Lebensmittelchemies in any MST of .. We use a lower bound given by a linear programming relaxation to the problem and strengthen known graph-theoretic results on minimum degree subgraphs [3,5] to prove our result. Previous results for the problem [1,4] used a combinatorial lower bound which is weaker than the LP bound we use.