Markus Holzer
YOU?
Author Swipe
View article: A Pipeline for Automated Quality Control of Chest Radiographs
A Pipeline for Automated Quality Control of Chest Radiographs Open
This article presents a suite of quality control tools for chest radiographs based on traditional and artificial intelligence methods, developed and tested with data from 39 centers in seven countries.
View article: On Minimal Pumping Constants for Regular Languages
On Minimal Pumping Constants for Regular Languages Open
The study of the operational complexity of minimal pumping constants started\nin [J. DASSOW and I. JECKER. Operational complexity and pumping lemmas. Acta\nInform., 59:337-355, 2022], where an almost complete picture of the operational\nco…
View article: A pipeline to further enhance quality, integrity and reusability of the NCCID clinical data
A pipeline to further enhance quality, integrity and reusability of the NCCID clinical data Open
The National COVID-19 Chest Imaging Database (NCCID) is a centralized UK database of thoracic imaging and corresponding clinical data. It is made available by the National Health Service Artificial Intelligence (NHS AI) Lab to support the …
View article: On the accepting state complexity of operations on permutation automata
On the accepting state complexity of operations on permutation automata Open
We investigate the accepting state complexity of deterministic finite automata for regular languages obtained by applying one of the following operations on languages accepted by permutation automata: union, quotient, complement, differenc…
View article: On the Accepting State Complexity of Operations on Permutation Automata
On the Accepting State Complexity of Operations on Permutation Automata Open
We investigate the accepting state complexity of deterministic finite\nautomata for regular languages obtained by applying one of the following\noperations to languages accepted by permutation automata: union, quotient,\ncomplement, differ…
View article: 12-lead post-ROSC electrocardiogram discriminates survival to hospital discharge. A sub-analysis of the PEACE study
12-lead post-ROSC electrocardiogram discriminates survival to hospital discharge. A sub-analysis of the PEACE study Open
Funding Acknowledgements Type of funding sources: None. Background Once the return of spontaneous circulation (ROSC) after an out-of-hospital cardiac arrest (OHCA) is achieved the acquisition of a 12-lead electrocardiogram (ECG) is strongl…
View article: C60 12–LEAD POST–ROSC ELECTROCARDIOGRAM DISCRIMINATES SURVIVAL TO HOSPITAL DISCHARGE. A SUB–ANALYSIS OF THE PEACE STUDY
C60 12–LEAD POST–ROSC ELECTROCARDIOGRAM DISCRIMINATES SURVIVAL TO HOSPITAL DISCHARGE. A SUB–ANALYSIS OF THE PEACE STUDY Open
Background Once the return of spontaneous circulation (ROSC) after an out–of–hospital cardiac arrest (OHCA) is achieved in patients with an ST–elevation myocardial infarction, the acquisition of a 12–lead electrocardiogram (ECG) is strongl…
View article: Optimal Regular Expressions for Palindromes of Given Length
Optimal Regular Expressions for Palindromes of Given Length Open
The language P_n (P̃_n, respectively) consists of all words that are palindromes of length 2n (2n-1, respectively) over a fixed binary alphabet. We construct a regular expression that specifies P_n (P̃_n, respectively) of alphabetic width 4⋅…
View article: On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. Open
In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the languages accept…
View article: Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019)
Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019) Open
Holzer, M.; Sempere Luna, JM. (2021). Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019). RAIRO - Theoretical Informatics and Applications. 55:1-2. https://doi.org/10.1051/ita/2021009
View article: On the Complexity of Intersection Non-emptiness for Star-Free Language Classes
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes Open
In the Intersection Non-emptiness problem, we are given a list of finite automata A_1, A_2,… , A_m over a common alphabet Σ as input, and the goal is to determine whether some string w ∈ Σ^* lies in the intersection of the languages accept…
View article: Common pitfalls and recommendations for using machine learning to detect and prognosticate for COVID-19 using chest radiographs and CT scans
Common pitfalls and recommendations for using machine learning to detect and prognosticate for COVID-19 using chest radiographs and CT scans Open
Machine learning methods offer great promise for fast and accurate detection and prognostication of coronavirus disease 2019 (COVID-19) from standard-of-care chest radiographs (CXR) and chest computed tomography (CT) images. Many articles …
View article: On the Computational Complexity of Synchronized Context-Free Languages
On the Computational Complexity of Synchronized Context-Free Languages Open
We introduce counter synchronized context-free grammars and investigate their generative power. It turns out that the family of counter synchronized context-free languages is a proper superset of the family of context-free languages and is…
View article: Grammar Systems with Negated Conditions in their Cooperation Protocols
Grammar Systems with Negated Conditions in their Cooperation Protocols Open
The investigation on Boolean operations on the stop conditions of derivation modes for cooperating distributed grammar systems is continued by considering the logical negation of such conditions. The focus is on the negation of the t-mode …
View article: Automata That May Change Their Mind
Automata That May Change Their Mind Open
We introduce the concept of mind-changing automata. Basically, the idea is that at the outset the automaton is partially deterministic. Whenever the automaton encounters a situation for which it has an undefined transition, it may choose a…
View article: Semicomputable Points in Euclidean Spaces
Semicomputable Points in Euclidean Spaces Open
We introduce the notion of a semicomputable point in R^n, defined as a point having left-c.e. projections. We study the range of such a point, which is the set of directions on which its projections are left-c.e., and is a convex cone. We …
View article: On bonded sequential and parallel insertion systems
On bonded sequential and parallel insertion systems Open
We introduce a new variant of insertion systems, namely bonded insertion systems. In such systems, words are not only formed by usual letters but also by bonds between letters. Words which can be inserted, have “free” bonds at their ends w…
View article: Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms
Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms Open
We continue our research on perversely awful randomized algorithms, which started nearly a decade ago. Based on the bogo-method we design a bogo-selection algorithm and variants thereof and analyse them with elementary methods. Moreover, p…
View article: On bonded indian and uniformly parallel insertion systems and their generative power
On bonded indian and uniformly parallel insertion systems and their generative power Open
Insertion is an operation in formal language theory that generalizes the operation of concatenation of words, where its variants allow the operation in different ways. Parallel insertion is a variant of insertion that simultaneously adds w…
View article: Input-Driven Double-Head Pushdown Automata
Input-Driven Double-Head Pushdown Automata Open
We introduce and study input-driven deterministic and nondeterministic\ndouble-head pushdown automata. A double-head pushdown automaton is a slight\ngeneralization of an ordinary pushdown automaton working with two input heads\nthat move i…
View article: On the Descriptional Complexity of Operations on Semilinear Sets
On the Descriptional Complexity of Operations on Semilinear Sets Open
We investigate the descriptional complexity of operations on semilinear sets.\nRoughly speaking, a semilinear set is the finite union of linear sets, which\nare built by constant and period vectors. The interesting parameters of a\nsemilin…
View article: On the Computational Complexity of Partial Word Automata Problems
On the Computational Complexity of Partial Word Automata Problems Open
We consider computational complexity of problems related to partial word au- tomata. Roughly speaking, a partial word is a word in which some positions are unspecified, and a partial word automaton is a finite automaton that accepts a part…
View article: Preface: Non-Classical Models of Automata and Applications VII
Preface: Non-Classical Models of Automata and Applications VII Open
The Seventh Workshop on Non-Classical Models of Automata and Applications (NCMA 2015) was organised to bring together researchers who work on various aspects of non-classical and classical models of automata, providing an excellent opportu…