Markus Holzer

According to our database1, Markus Holzer
  • authored at least 214 papers between 1992 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
The chop of languages.
Theor. Comput. Sci., 2017

More on deterministic and nondeterministic finite cover automata.
Theor. Comput. Sci., 2017

More on Minimizing Finite Automata with Errors - Nondeterministic Machines.
Int. J. Found. Comput. Sci., 2017

Tight Bounds for Cut-Operations on Deterministic Finite Automata.
Fundam. Inform., 2017

Input-Driven Double-Head Pushdown Automata.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

On the Descriptional Complexity of Operations on Semilinear Sets.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

On the Number of Active States in Deterministic and Nondeterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2017

Reversible Nondeterministic Finite Automata.
Proceedings of the Reversible Computation - 9th International Conference, 2017

Two-sided strictly locally testable languages.
Proceedings of the Ninth Workshop on Non-Classical Models of Automata and Applications, 2017

On the Mother of All Automata: The Position Automaton.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

Operational State Complexity and Decidability of Jumping Finite Automata.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

On Regular Expression Proof Complexity.
Proceedings of the Developments in Language Theory - 21st International Conference, 2017

One-Time Nondeterministic Computations.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

Structure and Complexity of Some Subregular Language Families.
Proceedings of the Role of Theory in Computer Science, 2017

2016
Boundary sets of regular and context-free languages.
Theor. Comput. Sci., 2016

Preface.
Journal of Automata, Languages and Combinatorics, 2016

Editorial.
Journal of Automata, Languages and Combinatorics, 2016

Minimal and Hyper-Minimal Biautomata.
Int. J. Found. Comput. Sci., 2016

On the Computational Complexity of Partial Word Automata Problems.
Fundam. Inform., 2016

The Degree of Irreversibility in Deterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2016

On bonded sequential and parallel insertion systems.
Proceedings of the Eighth Workshop on Non-Classical Models of Automata and Applications, 2016

Reversible Shrinking Two-Pushdown Automata.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
Preface.
Int. J. Found. Comput. Sci., 2015

From Finite Automata to Regular Expressions and Back - A Summary on Descriptional Complexity.
Int. J. Found. Comput. Sci., 2015

The Finite Index Restriction Meets Hybrid Modes in Cooperating Distributed Grammar Systems.
Int. J. Found. Comput. Sci., 2015

Minimization and Characterizations for Biautomata.
Fundam. Inform., 2015

More on Deterministic and Nondeterministic Finite Cover Automata - Extended Abstract.
Proceedings of the Implementation and Application of Automata, 2015

On relations between some subregular language families.
Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

Tight Bounds for Cut-Operations on Deterministic Finite Automata.
Proceedings of the Machines, Computations, and Universality - 7th International Conference, 2015

Minimal Reversible Deterministic Finite Automata.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

On the Computational Complexity of Problems Related to Distinguishability Sets.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014
Self-Assembling Pushdown Automata.
Journal of Automata, Languages and Combinatorics, 2014

Preface.
RAIRO - Theor. Inf. and Applic., 2014

Nondeterministic Biautomata and their Descriptional Complexity.
Int. J. Found. Comput. Sci., 2014

More Structural Characterizations of Some Subregular Language Families by Biautomata.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

From Finite Automata to Regular Expressions and Back-A Summary on Descriptional Complexity.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 2014

On the computational complexity of partial word automata problems.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

ω-rational Languages: High Complexity Classes vs. Borel Hierarchy.
Proceedings of the Language and Automata Theory and Applications, 2014

Minimal and Hyper-Minimal Biautomata - (Extended Abstract).
Proceedings of the Developments in Language Theory - 18th International Conference, 2014

Boundary Sets of Regular and Context-Free Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2014

2013
From Equivalence to Almost-Equivalence, and beyond: Minimizing Automata with Errors.
Int. J. Found. Comput. Sci., 2013

Provably Shorter Regular Expressions from Finite Automata.
Int. J. Found. Comput. Sci., 2013

Brzozowski's Minimization Algorithm - More Robust than Expected - (Extended Abstract).
Proceedings of the Implementation and Application of Automata, 2013

Minimization and characterizations for biautomata.
Proceedings of the Fifth Workshop on Non-Classical Models for Automata and Applications - NCMA 2013, Umeå, Sweden, August 13, 2013

Nondeterministic Biautomata and Their Descriptional Complexity.
Proceedings of the Descriptional Complexity of Formal Systems, 2013

2012
Preface.
Theor. Comput. Sci., 2012

Nondeterministic state complexity of star-free languages.
Theor. Comput. Sci., 2012

Descriptional Complexity of Chop Operations on Unary and Finite Languages.
Journal of Automata, Languages and Combinatorics, 2012

On Inverse Operations and Their Descriptional Complexity.
Journal of Automata, Languages and Combinatorics, 2012

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011).
RAIRO - Theor. Inf. and Applic., 2012

The Magic Number Problem for Subregular Language Families.
Int. J. Found. Comput. Sci., 2012

Input-Driven Stack Automata.
Proceedings of the Theoretical Computer Science, 2012

Grid Graphs with Diagonal Edges and the Complexity of Xmas Mazes.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

On the Complexity of Rolling Block and Alice Mazes.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

On Computer Integrated Rationalized Crossword Puzzle Manufacturing.
Proceedings of the Fun with Algorithms - 6th International Conference, 2012

Generalized Derivations with Synchronized Context-Free Grammars.
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

From Equivalence to Almost-Equivalence, and Beyond - Minimizing Automata with Errors - (Extended Abstract).
Proceedings of the Developments in Language Theory - 16th International Conference, 2012

State Complexity of Chop Operations on Unary and Finite Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

On Inverse Operations and Their Descriptional Complexity.
Proceedings of the Descriptional Complexity of Formal Systems, 2012

A Note on Combined Derivation Modes for Cooperating Distributed Grammar Systems.
Proceedings of the Languages Alive, 2012

2011
Complexity of multi-head finite automata: Origins and directions.
Theor. Comput. Sci., 2011

Equilibria of graphical games with symmetries.
Theor. Comput. Sci., 2011

On the size of inverse semigroups given by generators.
Theor. Comput. Sci., 2011

Hairpin Finite Automata.
Journal of Automata, Languages and Combinatorics, 2011

The Complexity of Regular(-like) Expressions.
Int. J. Found. Comput. Sci., 2011

Descriptional and computational complexity of finite automata - A survey.
Inf. Comput., 2011

Decidability of operation problems for T0L languages and subclasses.
Inf. Comput., 2011

Computational Complexity of NURIKABE.
Fundam. Inform., 2011

Preface.
Fundam. Inform., 2011

Nondeterministic State Complexity of Star-Free Languages.
Proceedings of the Implementation and Application of Automata, 2011

Gaining Power by Input Operations: Finite Automata and Beyond.
Proceedings of the Implementation and Application of Automata, 2011

Nodes Connected by Path Languages.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Chop Operations and Expressions: Descriptional Complexity Considerations.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Cooperating Distributed Grammar Systems: Components with Nonincreasing Competence.
Proceedings of the Computation, 2011

The Chop of Languages.
Proceedings of the Automata and Formal Languages, 13th International Conference, 2011

2010
An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton.
Theor. Comput. Sci., 2010

On Measuring Non-recursive Trade-Offs.
Journal of Automata, Languages and Combinatorics, 2010

Extending regular expressions with homomorphic replacement.
RAIRO - Theor. Inf. and Applic., 2010

The Magic Number Problem for Subregular Language Families
Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

On Iterated Dominance, Matrix Elimination, and Matched Paths
CoRR, 2010

On Iterated Dominance, Matrix Elimination, and Matched Paths.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata.
Proceedings of the Reachability Problems, 4th International Workshop, 2010

Cellular Automata and the Quest for Nontrivial Artificial Self-Reproduction.
Proceedings of the Membrane Computing, 2010

The Computational Complexity of the Kakuro Puzzle, Revisited.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

The Computational Complexity of RaceTrack.
Proceedings of the Fun with Algorithms, 5th International Conference, 2010

The Complexity of Regular(-Like) Expressions.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

Descriptional Complexity - An Introductory Survey.
Proceedings of the Scientific Applications of Language Methods., 2010

2009
Language operations with regular expressions of polynomial size.
Theor. Comput. Sci., 2009

Determination of finite automata accepting subregular languages.
Theor. Comput. Sci., 2009

On the uniqueness of shuffle on words and finite languages.
Theor. Comput. Sci., 2009

Symmetries and the complexity of pure Nash equilibrium.
J. Comput. Syst. Sci., 2009

Nondeterministic Finite Automata - Recent Results on the Descriptional and Computational Complexity.
Int. J. Found. Comput. Sci., 2009

On input-revolving deterministic and nondeterministic finite automata.
Inf. Comput., 2009

More on the Size of Higman-Haines Sets: Effective Constructions.
Fundam. Inform., 2009

On Measuring Non-Recursive Trade-Offs
Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.
Proceedings of the Implementation and Application of Automata, 2009

Short Regular Expressions from Finite Automata: Empirical Results.
Proceedings of the Implementation and Application of Automata, 2009

Descriptional and Computational Complexity of Finite Automata.
Proceedings of the Language and Automata Theory and Applications, 2009

Undecidability of Operation Problems for T0L Languages and Subclasses.
Proceedings of the Language and Automata Theory and Applications, 2009

Tight Bounds on the Descriptional Complexity of Regular Expressions.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
A note on cooperating distributed grammar systems working in combined modes.
Inf. Process. Lett., 2008

On Iterated Dominance, Matrix Elimination, and Matched Paths.
Electronic Colloquium on Computational Complexity (ECCC), 2008

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 2008

Equilibria of Graphical Games with Symmetries.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity.
Proceedings of the Implementation and Applications of Automata, 2008

Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems.
Proceedings of the Language and Automata Theory and Applications, 2008

Deterministic Input-Reversal and Input-Revolving Finite Automata.
Proceedings of the Language and Automata Theory and Applications, 2008

Finite Automata, Digraph Connectivity, and Regular Expression Size.
Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Provably Shorter Regular Expressions from Deterministic Finite Automata.
Proceedings of the Developments in Language Theory, 12th International Conference, 2008

Language Operations with Regular Expressions of Polynomial Size.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

State Complexity of NFA to DFA Conversion of Subregular Language Families.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008

2007
The size of Higman-Haines sets.
Theor. Comput. Sci., 2007

On the average state and transition complexity of finite languages.
Theor. Comput. Sci., 2007

Non-Recursive Trade-Offs for Deterministic Restarting Automata.
Journal of Automata, Languages and Combinatorics, 2007

Hybrid Extended Finite Automata.
Int. J. Found. Comput. Sci., 2007

On Competence in CD Grammar Systems with Parallel Rewriting.
Int. J. Found. Comput. Sci., 2007

Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited.
Fundam. Inform., 2007

Equilibria of Graphical Games with Symmetries.
Electronic Colloquium on Computational Complexity (ECCC), 2007

The Complexity of Tensor Circuit Evaluation.
Computational Complexity, 2007

Symmetries and the Complexity of Pure Nash Equilibrium.
Proceedings of the STACS 2007, 2007

More on the Size of Higman-Haines Sets: Effective Constructions.
Proceedings of the Machines, Computations, and Universality, 5th International Conference, 2007

Computational Complexity of NFA Minimization for Finite and Unary Languages.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms.
Proceedings of the Fun with Algorithms, 4th International Conference, 2007

Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

Hairpin Finite Automata.
Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2006
Iterated sequential transducers as language generating devices.
Theor. Comput. Sci., 2006

The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria.
Inf. Process. Lett., 2006

CD grammar systems with competence based entry conditions in their cooperation protocols.
Int. J. Comput. Math., 2006

Variable Complexity of Simple Programs.
Fundam. Inform., 2006

Finding Lower Bounds for Nondeterministic State Complexity is Hard.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Symmetries and the Complexity of Pure Nash Equilibrium.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Programmed grammars and their relation to the LBA problem.
Acta Inf., 2006

Hybrid Extended Finite Automata.
Proceedings of the Implementation and Application of Automata, 2006

Finding Lower Bounds for Nondeterministic State Complexity Is Hard.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006

The Size of Higman-Haines Sets.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

Results on the Average State and Transition Complexity of Finite Automata Accepting Finite Languages (Extended Abstract).
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005
On the descriptional complexity of finite automata with modified acceptance conditions.
Theor. Comput. Sci., 2005

A common algebraic description for probabilistic and quantum computations, .
Theor. Comput. Sci., 2005

Language families defined by a ciliate bio-operation: hierarchies and decision problems.
Int. J. Found. Comput. Sci., 2005

Unsolvability levels of operation problems for subclasses of context-free languages.
Int. J. Found. Comput. Sci., 2005

Representations of Recursively Enumerable Array Languages by Contextual Array Grammars.
Fundam. Inform., 2005

Shrinking Multi-pushdown Automata.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

Revolving-Input Finite Automata.
Proceedings of the Developments in Language Theory, 9th International Conference, 2005

Descriptional Complexity of Deterministic Restarting Automata.
Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

2004
Assembling molecules in ATOMIX is hard.
Theor. Comput. Sci., 2004

On deterministic finite automata and syntactic monoid size.
Theor. Comput. Sci., 2004

Economy of Description for Basic Constructions on Rational Transductions.
Journal of Automata, Languages and Combinatorics, 2004

Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other (Column: Formal Language Theory).
Bulletin of the EATCS, 2004

TantrixTM rotation puzzles are intractable.
Discrete Applied Mathematics, 2004

Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages.
Proceedings of the Implementation and Application of Automata, 2004

Towards Formal Semantics for ODRL.
Proceedings of the First International Workshop on the Open Digital Rights Language (ODRL), 2004

A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Register Complexity of LOOP-, WHILE-, and GOTO-Programs.
Proceedings of the Machines, Computations, and Universality, 4th International Conference, 2004

Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages.
Proceedings of the Developments in Language Theory, 2004

On Competence in CD Grammar Systems.
Proceedings of the Developments in Language Theory, 2004

2003
Alternating and empty alternating auxiliary stack automata.
Theor. Comput. Sci., 2003

Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k.
Theor. Comput. Sci., 2003

McNaughton families of languages.
Theor. Comput. Sci., 2003

Nondeterministic Descriptional Complexity Of Regular Languages.
Int. J. Found. Comput. Sci., 2003

Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Flip-Pushdown Automata: Nondeterminism Is Better than Determinism.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

On Deterministic Finite Automata and Syntactic Monoid Size, Continued.
Proceedings of the Developments in Language Theory, 7th International Conference, 2003

On the Descriptional Complexity of Finite Automata With Modified Acceptance Conditions.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

On Iterated Sequential Transducers.
Proceedings of the Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology, 2003

2002
Multi-head finite automata: data-independent versus data-dependent computations.
Theor. Comput. Sci., 2002

On the Computational Complexity of Synchronized Context-Free Languages.
J. UCS, 2002

Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.
Journal of Automata, Languages and Combinatorics, 2002

The complexity of tensor calculus.
Computational Complexity, 2002

State Complexity of Basic Operations on Nondeterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 2002

On Deterministic Finite Automata and Syntactic Monoid Size.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Unary Language Operations and Their Nondeterministic State Complexity.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Economy of Descriptions for Basic Constructions on Rational Transductions.
Proceedings of the Fourth International Workshop on Descriptional Complexity of Formal Systems - DCFS 2002, London, Canada, August 21, 2002

2001
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization.
Theor. Comput. Sci., 2001

On the State Complexity of k-Entry Deterministic Finite Automata.
Journal of Automata, Languages and Combinatorics, 2001

On the Number of Active Symbols in L and CD Grammar Systems.
Journal of Automata, Languages and Combinatorics, 2001

Improving Raster Image Run-Length Encoding Using Data Order.
Proceedings of the Implementation and Application of Automata, 2001

The Complexity of Tensor Circuit Evaluation.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy.
Proceedings of the Developments in Language Theory, 5th International Conference, 2001

Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.
Proceedings of the Third International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures - DCAGRS 2001, Vienna, Austria, July 20, 2001

2000
Grammar Systems with Negated Conditions in their Cooperation Protocols
J. UCS, 2000

The Complexity of Tensor Calculus
Electronic Colloquium on Computational Complexity (ECCC), 2000

Alternating and Empty Alternating Auxiliary Stack Automata.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

The Complexity of Tensor Calculus.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000

External Contextual and Conditional Languages.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems.
Inf. Process. Lett., 1999

On Accepting Pure Lindenmayer Systems.
Fundam. Inform., 1999

Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations.
Proceedings of the Grammatical Models of Multi-Agent Systems, 1999

On fixed and general membership for external and internal contextual languages.
Proceedings of the Developments in Language Theory, 1999

Cooperating distributed grammar systems with non-terminating components.
Proceedings of the Developments in Language Theory, 1999

1998
Data-independent versus data-dependent computations on multi-head automata.
PhD thesis, 1998

Character Recognition with k-Head Finite Array Automata.
Proceedings of the Advances in Pattern Recognition, 1998

The Generative Power of d-Dimensional #-Context-Free Array Grammars.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

VisA: A Tool for Visualizing and Animating Automata and Formal Languages.
Proceedings of the Graph Drawing, 6th International Symposium, 1998

VisA: towards a students' green card to automata theory and formal languages.
Proceedings of the ACM SIGCSE 3rd Australasian Conference on Computer Science Education, 1998

1997
Expressing Uniformity via Oracles.
Theory Comput. Syst., 1997

Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Bounding resources in Cooperating Distributed Grammar Systems.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

On the Complexity of Iterated Insertions.
Proceedings of the New Trends in Formal Languages, 1997

Conditional Context-Free Languages of Finite Index.
Proceedings of the New Trends in Formal Languages, 1997

1996
Inductive Counting for Width-Restricted Branching Programs.
Inf. Comput., 1996

Accepting Multi-Agent Systems.
Computers and Artificial Intelligence, 1996

Accepting Multi-Agent Systems II.
Acta Cybern., 1996

1995
Expressing Uniformity via Oracles
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1995

Automata That Take Advice.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

On Emptiness and Counting for Alternating Finite Automata.
Proceedings of the Developments in Language Theory II, 1995

1994
Inductive Counting below LOGSPACE
Universität Trier, Mathematik/Informatik, Forschungsbericht, 1994

Inductive Counting Below LOGSPACE.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993
On the Complexities of Linear LL(1) and LR(1) Grammars.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Deterministic OL Languages are of Very Low Complexity: DOL is in AC0.
Proceedings of the Developments in Language Theory, 1993

1992
Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992


  Loading...