default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSebastian Jakobi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j16]Sebastian Jakobi, Katja Meckel, Carlo Mereghetti
, Beatrice Palano:
The descriptional power of queue automata of constant length. Acta Informatica 58(4): 335-356 (2021)
2010 – 2019
- 2019
- [c24]Markus Holzer, Sebastian Jakobi:
A comment on strong language families and self-verifying complexity classes. NCMA 2019: 93-108 - 2018
- [j15]Markus Holzer, Sebastian Jakobi:
On the computational complexity of problems related to distinguishability sets. Inf. Comput. 259(2): 225-236 (2018) - [j14]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
Minimal Reversible Deterministic Finite Automata. Int. J. Found. Comput. Sci. 29(2): 251-270 (2018) - [c23]Markus Holzer, Sebastian Jakobi, Jozef Jirásek Jr.:
Computational Complexity of Decision Problems on Self-verifying Finite Automata. DLT 2018: 404-415 - 2017
- [j13]Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe:
Tight Bounds for Cut-Operations on Deterministic Finite Automata. Fundam. Informaticae 155(1-2): 89-110 (2017) - [j12]Markus Holzer, Sebastian Jakobi:
More on Minimizing Finite Automata with Errors - Nondeterministic Machines. Int. J. Found. Comput. Sci. 28(3): 229-246 (2017) - [j11]Hermann Gruber, Markus Holzer, Sebastian Jakobi:
More on deterministic and nondeterministic finite cover automata. Theor. Comput. Sci. 679: 18-30 (2017) - [j10]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The chop of languages. Theor. Comput. Sci. 682: 122-137 (2017) - 2016
- [j9]Markus Holzer, Sebastian Jakobi, Matthias Wendlandt:
On the Computational Complexity of Partial Word Automata Problems. Fundam. Informaticae 148(3-4): 267-289 (2016) - [j8]Markus Holzer, Sebastian Jakobi:
Minimal and Hyper-Minimal Biautomata. Int. J. Found. Comput. Sci. 27(2): 161-186 (2016) - [j7]Markus Holzer, Sebastian Jakobi:
Boundary sets of regular and context-free languages. Theor. Comput. Sci. 610: 59-77 (2016) - 2015
- [b1]Sebastian Jakobi:
Modern aspects of classical automata theory: finite automata, biautomata, and lossy compression. Justus Liebig University Giessen, 2015, pp. 1-198 - [j6]Markus Holzer, Sebastian Jakobi:
Minimization and Characterizations for Biautomata. Fundam. Informaticae 136(1-2): 113-137 (2015) - [c22]Markus Holzer, Sebastian Jakobi:
On the Computational Complexity of Problems Related to Distinguishability Sets. DCFS 2015: 117-128 - [c21]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
Minimal Reversible Deterministic Finite Automata. DLT 2015: 276-287 - [c20]Frank Drewes, Markus Holzer, Sebastian Jakobi, Brink van der Merwe:
Tight Bounds for Cut-Operations on Deterministic Finite Automata. MCU 2015: 45-60 - [c19]Holger Bock Axelsen, Sebastian Jakobi, Martin Kutrib, Andreas Malcher:
A Hierarchy of Fast Reversible Turing Machines. RC 2015: 29-44 - [c18]Hermann Gruber, Markus Holzer, Sebastian Jakobi:
More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract. CIAA 2015: 114-126 - 2014
- [j5]Markus Holzer, Sebastian Jakobi:
Nondeterministic Biautomata and their Descriptional Complexity. Int. J. Found. Comput. Sci. 25(7): 837-856 (2014) - [c17]Markus Holzer, Sebastian Jakobi:
Boundary Sets of Regular and Context-Free Languages. DCFS 2014: 162-173 - [c16]Markus Holzer, Sebastian Jakobi:
Minimal and Hyper-Minimal Biautomata - (Extended Abstract). Developments in Language Theory 2014: 291-302 - [c15]Markus Holzer, Sebastian Jakobi, Matthias Wendlandt:
On the computational complexity of partial word automata problems. NCMA 2014: 131-146 - [c14]Markus Holzer, Sebastian Jakobi:
More Structural Characterizations of Some Subregular Language Families by Biautomata. AFL 2014: 271-285 - 2013
- [j4]Markus Holzer, Sebastian Jakobi:
From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors. Int. J. Found. Comput. Sci. 24(7): 1083-1098 (2013) - [c13]Markus Holzer, Sebastian Jakobi:
Nondeterministic Biautomata and Their Descriptional Complexity. DCFS 2013: 112-123 - [c12]Sebastian Jakobi, Katja Meckel, Carlo Mereghetti, Beatrice Palano:
Queue Automata of Constant Length. DCFS 2013: 124-135 - [c11]Markus Holzer, Sebastian Jakobi:
Minimization and characterizations for biautomata. NCMA 2013: 179-193 - [c10]Markus Holzer, Sebastian Jakobi:
Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract). CIAA 2013: 181-192 - 2012
- [j3]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Magic Number Problem for Subregular Language Families. Int. J. Found. Comput. Sci. 23(1): 115-131 (2012) - [j2]Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Carlo Mereghetti, Beatrice Palano, Giovanni Pighizzini:
On Inverse Operations and Their Descriptional Complexity. J. Autom. Lang. Comb. 17(2-4): 61-81 (2012) - [j1]Markus Holzer, Sebastian Jakobi:
Descriptional Complexity of Chop Operations on Unary and Finite Languages. J. Autom. Lang. Comb. 17(2-4): 165-183 (2012) - [c9]Maria Paola Bianchi, Markus Holzer, Sebastian Jakobi, Giovanni Pighizzini:
On Inverse Operations and Their Descriptional Complexity. DCFS 2012: 89-102 - [c8]Markus Holzer, Sebastian Jakobi:
State Complexity of Chop Operations on Unary and Finite Languages. DCFS 2012: 169-182 - [c7]Markus Holzer, Sebastian Jakobi, Ian McQuillan:
Generalized Derivations with Synchronized Context-Free Grammars. Developments in Language Theory 2012: 109-120 - [c6]Markus Holzer, Sebastian Jakobi:
From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract). Developments in Language Theory 2012: 190-201 - [c5]Markus Holzer, Sebastian Jakobi:
On the Complexity of Rolling Block and Alice Mazes. FUN 2012: 210-222 - [c4]Markus Holzer, Sebastian Jakobi:
Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes. FUN 2012: 223-234 - 2011
- [c3]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Chop of Languages. AFL 2011: 197-210 - [c2]Markus Holzer, Sebastian Jakobi:
Chop Operations and Expressions: Descriptional Complexity Considerations. Developments in Language Theory 2011: 264-275 - 2010
- [c1]Markus Holzer, Sebastian Jakobi, Martin Kutrib:
The Magic Number Problem for Subregular Language Families. DCFS 2010: 110-119
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-04-24 23:02 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:
