13 search results - page 2 / 3 » Strict Language Inequalities and Their Decision Problems |
PODS
2010
ACM
13 years 10 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
JGO
2008
13 years 5 months ago
2008
Abstract In this paper we present an evolutionary variational inequality model of vaccination strategies games in a population with a known vaccine coverage profile over a certain ...
ECCC
2006
13 years 5 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
ICFCA
2010
Springer
14 years 9 days ago
2010
Springer
We investigate the complexity of enumerating pseudo-intents in the lectic order. We look at the following decision problem: Given a formal context and a set of n pseudo-intents det...
VLSID
2002
IEEE
14 years 5 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...