default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHermann Gruber
Person information
- affiliation: Planerio GmbH, München, Germany
- affiliation (former): Knowledgepark GmbH, München, Germany
- affiliation (former): University of Giessen, Germany
- affiliation (former): Ludwig-Maximilians-Universität München, Germany
- affiliation (former): Technische Universität München (TUM), Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c24]Hermann Gruber, Markus Holzer, Christian Rauch:
The Pumping Lemma for Context-Free Languages is Undecidable. DLT 2024: 141-155- [c23]Hermann Gruber, Markus Holzer, Christian Rauch:
On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract). CIAA 2024: 153-165 - 2023
- [c22]Hermann Gruber
, Markus Holzer, Christian Rauch:
The Pumping Lemma for Regular Languages is Hard. CIAA 2023: 128-140 - 2022
- [c21]Hermann Gruber, Markus Holzer, Christian Rauch:
On 25 Years of CIAA Through the Lens of Data Science. CIAA 2022: 3-18 - 2021
- [c20]Hermann Gruber, Markus Holzer, Simon Wolfsteiner:
On Minimizing Regular Expressions Without Kleene Star. FCT 2021: 245-258 - [c19]Hermann Gruber, Markus Holzer:
Optimal Regular Expressions for Palindromes of Given Length. MFCS 2021: 52:1-52:15 - [p2]Hermann Gruber, Markus Holzer, Martin Kutrib:
Descriptional complexity of regular languages. Handbook of Automata Theory (I.) 2021: 411-457 - [p1]Hermann Gruber, Jonathan Lee, Jeffrey O. Shallit:
Enumerating regular expressions and their languages. Handbook of Automata Theory (I.) 2021: 459-491 - 2020
- [i6]Hermann Gruber, Markus Holzer, Simon Wolfsteiner:
On Minimizing Regular Expressions Without Kleene Star. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2018
- [c18]Hermann Gruber, Markus Holzer, Simon Wolfsteiner:
On Minimal Grammar Problems for Finite Languages. DLT 2018: 342-353 - 2017
- [j10]Hermann Gruber, Markus Holzer, Sebastian Jakobi:
More on deterministic and nondeterministic finite cover automata. Theor. Comput. Sci. 679: 18-30 (2017) - 2015
- [j9]Hermann Gruber, Markus Holzer:
From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity. Int. J. Found. Comput. Sci. 26(8): 1009-1040 (2015) - [c17]Hermann Gruber, Markus Holzer, Sebastian Jakobi:
More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract. CIAA 2015: 114-126 - 2014
- [c16]Hermann Gruber, Markus Holzer:
From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity. AFL 2014: 25-48 - 2013
- [j8]Hermann Gruber, Markus Holzer:
Provably Shorter Regular Expressions from Finite Automata. Int. J. Found. Comput. Sci. 24(8): 1255-1280 (2013) - 2012
- [j7]Hermann Gruber:
Digraph Complexity Measures and Applications in Formal Language Theory. Discret. Math. Theor. Comput. Sci. 14(2): 189-204 (2012) - [i5]Hermann Gruber, Jonathan Lee, Jeffrey O. Shallit:
Enumerating regular expressions and their languages. CoRR abs/1204.4982 (2012) - 2011
- [j6]Hermann Gruber:
Bounding the feedback vertex number of digraphs in terms of vertex degrees. Discret. Appl. Math. 159(8): 872-875 (2011) - [i4]Hermann Gruber:
Bounding the Feedback Vertex Number of Digraphs in Terms of Vertex Degrees. CoRR abs/1101.1291 (2011) - [i3]Hermann Gruber:
Digraph Complexity Measures and Applications in Formal Language Theory. CoRR abs/1111.5357 (2011) - 2010
- [b1]Hermann Gruber:
On the descriptional and algorithmic complexity of regular languages. Justus Liebig University Giessen, 2010, ISBN 978-3-938363-62-1, pp. 1-174 - [j5]Hermann Gruber, Markus Holzer, Martin Kutrib:
On Measuring Non-recursive Trade-Offs. J. Autom. Lang. Comb. 15(1/2): 107-120 (2010) - [c15]Hermann Gruber, Stefan Gulan:
Simplifying Regular Expressions. LATA 2010: 285-296 - [i2]Hermann Gruber:
On Balanced Separators, Treewidth, and Cycle Rank. CoRR abs/1012.1344 (2010)
2000 – 2009
- 2009
- [j4]Hermann Gruber, Markus Holzer, Martin Kutrib:
More on the Size of Higman-Haines Sets: Effective Constructions. Fundam. Informaticae 91(1): 105-121 (2009) - [j3]Hermann Gruber, Markus Holzer:
Language operations with regular expressions of polynomial size. Theor. Comput. Sci. 410(35): 3281-3289 (2009) - [c14]Hermann Gruber, Markus Holzer:
Tight Bounds on the Descriptional Complexity of Regular Expressions. Developments in Language Theory 2009: 276-287 - [c13]Hermann Gruber, Markus Holzer, Michael Tautschnig:
Short Regular Expressions from Finite Automata: Empirical Results. CIAA 2009: 188-197 - [c12]Hermann Gruber, Markus Holzer, Martin Kutrib:
On Measuring Non-Recursive Trade-Offs. DCFS 2009: 141-150 - 2008
- [c11]Hermann Gruber, Markus Holzer:
Language Operations with Regular Expressions of Polynomial Size. DCFS 2008: 182-193 - [c10]Hermann Gruber, Markus Holzer:
Provably Shorter Regular Expressions from Deterministic Finite Automata. Developments in Language Theory 2008: 383-395 - [c9]Hermann Gruber, Jan Johannsen:
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. FoSSaCS 2008: 273-286 - [c8]Hermann Gruber, Markus Holzer:
Finite Automata, Digraph Connectivity, and Regular Expression Size. ICALP (2) 2008: 39-50 - 2007
- [j2]Hermann Gruber, Markus Holzer:
On the average state and transition complexity of finite languages. Theor. Comput. Sci. 387(2): 155-166 (2007) - [j1]Hermann Gruber, Markus Holzer, Martin Kutrib:
The size of Higman-Haines sets. Theor. Comput. Sci. 387(2): 167-176 (2007) - [c7]Hermann Gruber, Markus Holzer:
Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. Developments in Language Theory 2007: 205-216 - [c6]Hermann Gruber, Markus Holzer, Oliver Ruepp:
Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. FUN 2007: 183-197 - [c5]Hermann Gruber, Markus Holzer:
Computational Complexity of NFA Minimization for Finite and Unary Languages. LATA 2007: 261-272 - [c4]Hermann Gruber, Markus Holzer, Martin Kutrib:
More on the Size of Higman-Haines Sets: Effective Constructions. MCU 2007: 193-204 - 2006
- [c3]Hermann Gruber, Markus Holzer:
Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract). DCFS 2006: 267-275 - [c2]Hermann Gruber, Markus Holzer:
Finding Lower Bounds for Nondeterministic State Complexity Is Hard. Developments in Language Theory 2006: 363-374 - [i1]Hermann Gruber, Markus Holzer:
Finding Lower Bounds for Nondeterministic State Complexity is Hard. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c1]Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara König:
On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. Developments in Language Theory 2005: 272-283
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 00:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
