Zobrazeno 1 - 10
of 395
pro vyhledávání: '"Gruber, Hermann"'
Autor:
Gruber, Hermann
Zugl.: Giessen, Univ., Diss., 2009
Externí odkaz:
http://d-nb.info/998400602/04
Autor:
Gruber, Hermann, Holzer, Markus
Publikováno v:
EPTCS 151, 2014, pp. 25-48
The equivalence of finite automata and regular expressions dates back to the seminal paper of Kleene on events in nerve nets and finite automata from 1956. In the present paper we tour a fragment of the literature and summarize results on upper and l
Externí odkaz:
http://arxiv.org/abs/1405.5594
In this chapter we discuss the problem of enumerating distinct regular expressions by size and the regular languages they represent. We discuss various notions of the size of a regular expression that appear in the literature and their advantages and
Externí odkaz:
http://arxiv.org/abs/1204.4982
Autor:
Gruber, Hermann
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, 14(2):189-204, 2012
We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages. We explore this connection, and o
Externí odkaz:
http://arxiv.org/abs/1111.5357
Autor:
Gruber, Hermann
Publikováno v:
Discrete Applied Mathematics, 159(8):872-875, 2011
The Turan bound is a famous result in graph theory, which relates the independence number of an undirected graph to its edge density. Also the Caro-Wei inequality, which gives a more refined bound in terms of the vertex degree sequence of a graph, mi
Externí odkaz:
http://arxiv.org/abs/1101.1291
Autor:
Gruber, Hermann
Publikováno v:
Journal of Combinatorics, 3(4):669-681, 2012
We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with balanced separator number k has treewidth at least k but cycle rank at
Externí odkaz:
http://arxiv.org/abs/1012.1344
Publikováno v:
EPTCS 3, 2009, pp. 141-150
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general. We also ide
Externí odkaz:
http://arxiv.org/abs/0907.5063
Autor:
Gruber, Hermann
Publikováno v:
Mathematical Proceedings of the Cambridge Philosophical Society 147 (2009) 173-183
Stoimenow and Kidwell asked the following question: Let $K$ be a non-trivial knot, and let $W(K)$ be a Whitehead double of $K$. Let $F(a,z)$ be the Kauffman polynomial and $P(v,z)$ the skein polynomial. Is then always $\max\deg_z P_{W(K)} - 1 = 2 \ma
Externí odkaz:
http://arxiv.org/abs/math/0406106
Autor:
Gruber, Hermann
In this paper I give estimates for the minimal crossing number, leading to a short proof that the crossing number is additive for torus links. These estimates are applied to several classes of links. Finally, I prove a part of a conjecture relating t
Externí odkaz:
http://arxiv.org/abs/math/0303273
Autor:
Fahrner, Marc, Pandey, Saurabh K., Muik, Martin, Traxler, Lukas, Butorac, Carmen, Stadlbauer, Michael, Zayats, Vasilina, Krizova, Adéla, Plenk, Peter, Frischauf, Irene, Schindl, Rainer, Gruber, Hermann J., Hinterdorfer, Peter, Ettrich, Rüdiger, Romanin, Christoph, Derler, Isabella
Publikováno v:
In Journal of Biological Chemistry 26 January 2018 293(4):1271-1285
