1650 search results - page 85 / 330 » The HOM problem is decidable |
133
click to vote
ERSHOV
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
135
click to vote
GD
2007
Springer
15 years 10 months ago
2007
Springer
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
144
click to vote
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
We provide a uniform solution to the problem of synthesizing a finite-state distributed system. An instance of the synthesis problem consists of a system architecture and a tempo...
129
click to vote
FCT
2005
Springer
15 years 9 months ago
2005
Springer
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...
114
click to vote
WG
2005
Springer
15 years 9 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...