Abstract. Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such ...
Requirements for product families are expressed in terms of commonality and variability. This distinction allows early identification of an appropriate software architecture and ...
Andreas Classen, Patrick Heymans, Robin C. Laney, ...
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...