Dirichlet theorems and prime number hypotheses of a conditional Goldbach theorem.
Disconnectedness of Sublevel Sets of Some Riemannian.
Disjunction in modal description logics.
“Disorder” in lattices of binumerations
-immune sets.
E. T. a infinitární Churchova teze
Effective bounds on Morley rank
Effective cofinalities and admissibility in E-recursion
Effectiveness - non effectiveness in semialgebraic and PL geometry.
Efficient simulation of synchronous systems by multi-speed systems
We consider systems consisting of finite automata communicating by exchanging messages and working on the same read-only data. We investigate the situation in which the automata work with constant but different speeds. We assume furthermore that the automata are not aware of the speeds and they cannot measure them directly. Nevertheless, the automata have to compute a correct output. We call this model multi-speed systems of finite automata. Complexity measure that we consider here is the number...
Efficient simulation of synchronous systems by multi-speed systems
We consider systems consisting of finite automata communicating by exchanging messages and working on the same read-only data. We investigate the situation in which the automata work with constant but different speeds. We assume furthermore that the automata are not aware of the speeds and they cannot measure them directly. Nevertheless, the automata have to compute a correct output. We call this model multi-speed systems of finite automata. Complexity measure that we consider here is the...
Efficient weighted expressions conversion
J. Hromkovic et al. have given an elegant method to convert a regular expression of size into an -free nondeterministic finite automaton having states and transitions. This method has been implemented efficiently in time by C. Hagenah and A. Muscholl. In this paper we extend this method to weighted regular expressions and we show that it can be achieved in time.
Efficient weighted expressions conversion
J. Hromkovic et al. have given an elegant method to convert a regular expression of size n into an ε-free nondeterministic finite automaton having O(n) states and O(nlog2(n)) transitions. This method has been implemented efficiently in O(nlog2(n)) time by C. Hagenah and A. Muscholl. In this paper we extend this method to weighted regular expressions and we show that it can be achieved in O(nlog2(n)) time.
Ein algebraischer Beweis für das Church-Rosser-Theorem.
Ein in der reinen Zahlentheorie unbeweisbarer Satz über endliche Folgen von natürlichen Zahlen.
Ein starker Normalisationssatz für die bar-rekursiven Funktionale.
Eine beweistheoretische Anwendung partieller stetiger Funktionale.
Eine Funktionalinterpretation der prädikativen Analysis.
Eine rekursiv präsentierte Gruppe mit unentscheidbarem Wortlaut.
Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen.