Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete
✍ Scribed by Giménez, Omer; Godoy, Guillem; Maneth, Sebastian
- Book ID
- 118161213
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 2011
- Tongue
- English
- Weight
- 306 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0097-5397
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
In this paper we establish the topological regularity of the solution set of differential inclusions with constraints, defined in \(\mathbb{R}^{n}\). The result is then extended to systems defined in Banach spaces. Our proof makes use of an approximation result by Lipschitz functions of Caratheodory
Nondeterministic exponential time complexity bounds are established for recognizing true propositional formulas with partially ordered quantiÿers on propositional variables.
The reversibility problem for 90/150 cellular automata (both null and periodic boundary) is tackled using continua& and regular expressions. A 90/150 cellular automata can be uniquely encoded by a string over the alphabet (0, 1). It is shown that the set of strings which correspond to reversible 90/