Construction of parallel programs with networks of cooperating processes
Construction of solvable near-block designs with the aid of a computer. (Konstruktion auflösbarer Fast-Blockpläne mit Hilfe eines Computers.)
Construction of tree automata from regular expressions
Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov's partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automaton as well as for algorithmic improvements, we also transfer the methods of Champarnaud and Ziadi from words...
Construction of tree automata from regular expressions
Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative proof to this fact that results in smaller tree automata. To this aim, we transfer Antimirov's partial derivatives from regular word expressions to regular tree expressions. For an analysis of the size of the resulting automaton as well as for algorithmic improvements, we also transfer the methods of Champarnaud and Ziadi...
Construction of very hard functions for multiparty communication complexity
Construction of Very Hard Functions for Multiparty Communication Complexity
We consider the multiparty communication model defined in [4] using the formalism from [8]. First, we correct an inaccuracy in the proof of the fundamental result of [6] providing a lower bound on the nondeterministic communication complexity of a function. Then we construct several very hard functions, i.e., functions such that those as well as their complements have the worst possible nondeterministic communication complexity. The problem to find a particular very hard function was...
Constructive approximation of a ball by polytopes
Context-free grammars with regular conditions
Context-free languages with rational index in for algebraic numbers
Contextual grammars vs. context-free algebras
Continued fractions and transcendental numbers
The main purpose of this work is to present new families of transcendental continued fractions with bounded partial quotients. Our results are derived thanks to combinatorial transcendence criteria recently obtained by the first two authors in [3].
Continued fractions, Fibonacci numbers, and some classes of irrational numbers.
Contraction and treewidth lower bounds.
Contribution à la résolution numérique des équations de Laplace et de la chaleur
Contribution of František Matúš to the research on conditional independence
An overview is given of results achieved by F. Matúš on probabilistic conditional independence (CI). First, his axiomatic characterizations of stochastic functional dependence and unconditional independence are recalled. Then his elegant proof of discrete probabilistic representability of a matroid based on its linear representability over a finite field is recalled. It is explained that this result was a basis of his methodology for constructing a probabilistic representation of a given abstract...
Contributions to automatic construction and optimalization of identification keys
Control aspects of the blackboard agent architecture for a mobile robot
Control of uncertain processes: applied theory and algorithms
Controllability, applications, and numerical simulations of cellular neural networks.
Controllability of time-varying cellular neural networks.