120
click to vote
LATIN
2016
Springer
10 years 25 days ago
2016
Springer
:00 Simple realizability of complete abstract topological graphs simplified. Jan Kynˇcl. 11:00-11:30 Coffee break · · · · · · · · · · · · · · · · · · · · · ...
126
click to vote
LATIN
2016
Springer
10 years 25 days ago
2016
Springer
A graph G is called a block graph if each maximal 2-connected component of G is a clique. In this paper we study the Block Graph Vertex Deletion from the perspective of fixed para...
138
click to vote
LATA
2016
Springer
10 years 25 days ago
2016
Springer
Abstract. We study a subclass of tree-to-word transducers: linear treeto-word transducers, that cannot use several copies of the input. We aim to study the equivalence problem on t...
148
click to vote
LATA
2016
Springer
10 years 25 days ago
2016
Springer
Abstract. Finding minimal separating sequences for all pairs of inequivalent states in a finite state machine is a classic problem in automata theory. Sets of minimal separating s...
136
click to vote
LATA
2016
Springer
10 years 25 days ago
2016
Springer
Two of the most celebrated results that effectively exploit visual representation to give logical characterization and decidable modelchecking include visibly pushdown automata (V...