Sciweavers

2 search results - page 1 / 1
» On Binary Words Being Petri Net Solvable
Sort
View
LICS
2006
IEEE
13 years 10 months ago
Two-Variable Logic on Words with Data
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
Mikolaj Bojanczyk, Anca Muscholl, Thomas Schwentic...
JDA
2007
83views more  JDA 2007»
13 years 4 months ago
Optimal leaf ordering of complete binary trees
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
Ulrik Brandes