Detailansicht

Wissensnetz

Person

Markus Holzer

Informatiker

Name	Markus Holzer
Zeit	1994 (Wirkungsdaten)
Ort	Deutschland
Geschlecht	männlich
Akademischer Grad bzw. Titel	Prof. Dr.
Beruf	Informatiker (charakteristischer Beruf) Hochschullehrer
Variante	M. Holzer
Beziehung	Institut für Informatik (Gießen) (2008-)
Weitere Angaben	Tätig in dem Inst. für Informatik, Techn. Univ. München, Garching, Germany Wiener Neustadt, Fachhochschul-Studiengang System-, Informations- und Präzisionstechnik, Dipl.-Arb., 2007
Datensatztyp	Person
GND-Nummer	134200810
Datensatz-ID	134200810
Beteiligt an alle anzeigen Preface to Klaus-Jörn Lange Festschrift Generalized Synchronization and Intersection Non-Emptiness of Finite-State Automata On the number of active states in finite automata Semi-Linear Lattices and Right One-Way Jumping Finite Automata Properties of right one-way jumping finite automata A note on the computational complexity of some problems for self-verifying finite automata On the descriptional complexity of operations on semilinear sets On the magic number problem of the cut operation Algebraic Systems of Fixpoint Equations over Semirings: Theory and Applications Seventh Workshop on Non-Classical Models of Automata and Applications : NCMA 2015 Implementation and Application of Automata : 19th International Conference, CIAA 2014, Giessen, Germany, July 30 -- August 2, 2014, Proceedings Minimal and hyper-minimal biautomata Minimization, Characterizations, and Nondeterminism for Biautomata On the computational complexity of partial word automata problems 18. Theorietag "Automaten und Formale Sprachen" : Wettenberg-Launsbach bei Gießen 30. September 2. Oktober 2008 Fourth Workshop on Non-Classical Models for Automata and Applications : NCMA 2012 Grid graphs with diagonal edges and the complexity of Xmas mazes On the complexity of rolling block and Alice mazes Tight bounds on the descriptional complexity of regular expressions Descriptional complexity of formal systems : 13 international workshop ; proceedings Descriptional Complexity of Formal Systems : 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings javanet-framework : Ein Framework zur Kombination von Java und ASP.NET MVC Economy of Description for Basic Constructions on Rational Transductions Flip-Pushdown Automata: k+1 Pushdown Reversals are Better Than k Flip-Pushdown Automata: Nondeterminism is Better Than Determinism Improving Raster Image Run-Length Encoding Using Data Order Nondeterministic Descriptional Complexity of Regular Languages State Complexity of Basic Operations on Nondeterministic Finite Automata Unary Language Operations and Their Nondeterministic State Complexity Extending regular expressions with homomorphic replacement Extending regular expressions with homomorphic replacement Improving raster image run-length encoding using data order State complexity of basic operations on nondeterministic finite automata Unary language operations and their nondeterministic state complexity Accepting pure grammars and systems Data-independent versus data-dependent computations on multi-head automata Bidirectional cooperating distributed grammar systems Regulated finite index language families collapse 4. GI-Theorietag "Automaten und Formale Sprachen" : Herrsching bei München, 29. und 30. September 1994 Automata that take advice Expressing uniformity via oracles Inductive counting below LOGSPACE

Hinweis

Die Betaversion beinhaltet noch nicht alle Funktionen und Informationen des Katalogs des DNB-Portals. Falls Sie Informationen vermissen oder ein Medium bestellen wollen, besuchen Sie bitte die entsprechende Seite im Katalog des DNB-Portals über folgenden Link:

Katalog der Deutschen Nationalbibliothek

Markus Holzer

Preface to Klaus-Jörn Lange Festschrift

Generalized Synchronization and Intersection Non-Emptiness of Finite-State Automata

On the number of active states in finite automata

Semi-Linear Lattices and Right One-Way Jumping Finite Automata

Properties of right one-way jumping finite automata

A note on the computational complexity of some problems for self-verifying finite automata

On the descriptional complexity of operations on semilinear sets

On the magic number problem of the cut operation

Algebraic Systems of Fixpoint Equations over Semirings: Theory and Applications

Seventh Workshop on Non-Classical Models of Automata and Applications : NCMA 2015

Implementation and Application of Automata : 19th International Conference, CIAA 2014, Giessen, Germany, July 30 -- August 2, 2014, Proceedings

Minimal and hyper-minimal biautomata

Minimization, Characterizations, and Nondeterminism for Biautomata

On the computational complexity of partial word automata problems

18. Theorietag "Automaten und Formale Sprachen" : Wettenberg-Launsbach bei Gießen 30. September  2. Oktober 2008

Fourth Workshop on Non-Classical Models for Automata and Applications : NCMA 2012

Grid graphs with diagonal edges and the complexity of Xmas mazes

On the complexity of rolling block and Alice mazes

Tight bounds on the descriptional complexity of regular expressions

Descriptional complexity of formal systems : 13 international workshop ; proceedings

Descriptional Complexity of Formal Systems : 13th International Workshop, DCFS 2011, Gießen/Limburg, Germany, July 25-27, 2011. Proceedings

javanet-framework : Ein Framework zur Kombination von Java und ASP.NET MVC

Economy of Description for Basic Constructions on Rational Transductions

Flip-Pushdown Automata: k+1 Pushdown Reversals are Better Than k

Flip-Pushdown Automata: Nondeterminism is Better Than Determinism

Improving Raster Image Run-Length Encoding Using Data Order

Nondeterministic Descriptional Complexity of Regular Languages

State Complexity of Basic Operations on Nondeterministic Finite Automata

Unary Language Operations and Their Nondeterministic State Complexity

Extending regular expressions with homomorphic replacement

Extending regular expressions with homomorphic replacement

Improving raster image run-length encoding using data order

State complexity of basic operations on nondeterministic finite automata

Unary language operations and their nondeterministic state complexity

Accepting pure grammars and systems

Data-independent versus data-dependent computations on multi-head automata

Bidirectional cooperating distributed grammar systems

Regulated finite index language families collapse

4. GI-Theorietag "Automaten und Formale Sprachen" : Herrsching bei München, 29. und 30. September 1994

Automata that take advice

Expressing uniformity via oracles

Inductive counting below LOGSPACE

18. Theorietag "Automaten und Formale Sprachen" : Wettenberg-Launsbach bei Gießen 30. September 2. Oktober 2008