Markus Holzer

Orcid: 0000-0003-4224-4014

Affiliations:
  • University of Giessen, Germany
  • University of Tübingen, Germany


According to our database1, Markus Holzer authored at least 221 papers between 1992 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract).
Proceedings of the Implementation and Application of Automata, 2024

The Pumping Lemma for Context-Free Languages is Undecidable.
Proceedings of the Developments in Language Theory - 28th International Conference, 2024

On Regular Expression Proof Complexity of Salomaa's Axiom System F<sub>1</sub>.
Proceedings of the Taming the Infinities of Concurrency, 2024

2023
The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case.
Int. J. Found. Comput. Sci., December, 2023

On Minimal Pumping Constants for Regular Languages.
Proceedings of the 16th International Conference on Automata and Formal Languages, 2023

The Pumping Lemma for Regular Languages is Hard.
Proceedings of the Implementation and Application of Automata, 2023

Computational Complexity of Reversible Reaction Systems.
Proceedings of the Reversible Computation - 15th International Conference, 2023

On Jaffe's Pumping Lemma, Revisited.
Proceedings of the Descriptional Complexity of Formal Systems, 2023

2022
Input-Driven Double-Head Pushdown Automata.
Int. J. Found. Comput. Sci., 2022

Nondeterministic right one-way jumping finite automata.
Inf. Comput., 2022

On the Accepting State Complexity of Operations on Permutation Automata.
Proceedings of the Proceedings 12th International Workshop on Non-Classical Models of Automata and Applications, 2022

Preface to Klaus-Jörn Lange Festschrift.
Acta Informatica, 2022

On 25 Years of CIAA Through the Lens of Data Science.
Proceedings of the Implementation and Application of Automata, 2022

On the Descriptional Complexity of the Direct Product of Finite Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021
Preface: 11th Workshop on Non-classical Models of Automata and Applications (NCMA 2019).
RAIRO Theor. Informatics Appl., 2021

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

Two-Sided Strictly Locally Testable Languages.
Fundam. Informaticae, 2021

On the number of active states in finite automata.
Acta Informatica, 2021

The Range of State Complexities of Languages Resulting from the Cascade Product - The Unary Case (Extended Abstract).
Proceedings of the Implementation and Application of Automata, 2021

Optimal Regular Expressions for Palindromes of Given Length.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

The Range of State Complexities of Languages Resulting from the Cascade Product - The General Case (Extended Abstract).
Proceedings of the Developments in Language Theory - 25th International Conference, 2021

More on the Descriptional Complexity of Products of Finite Automata.
Proceedings of the Descriptional Complexity of Formal Systems, 2021

On the Computational Complexity of Reaction Systems, Revisited.
Proceedings of the Computer Science - Theory and Applications, 2021

Descriptional complexity of regular languages.
Proceedings of the Handbook of Automata Theory., 2021

2020
Automata That May Change Their Mind.
J. Autom. Lang. Comb., 2020

The Ranges of Accepting State Complexities of Languages Resulting from Some Operations.
Int. J. Found. Comput. Sci., 2020

Decidability of Right One-Way Jumping Finite Automata.
Int. J. Found. Comput. Sci., 2020

On Minimizing Regular Expressions Without Kleene Star.
Electron. Colloquium Comput. Complex., 2020

2019
Properties of right one-way jumping finite automata.
Theor. Comput. Sci., 2019

One-Time Nondeterministic Computations.
Int. J. Found. Comput. Sci., 2019

Operational State Complexity and Decidability of Jumping Finite Automata.
Int. J. Found. Comput. Sci., 2019

A mesh of automata.
Inf. Comput., 2019

Semi-linear Lattices and Right One-Way Jumping Finite Automata (Extended Abstract).
Proceedings of the Implementation and Application of Automata, 2019

A comment on strong language families and self-verifying complexity classes.
Proceedings of the Eleventh Workshop on Non-Classical Models of Automata and Applications, 2019

Computational Complexity of Synchronization under Regular Constraints.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

The Range of State Complexities of Languages Resulting from the Cut Operation.
Proceedings of the Language and Automata Theory and Applications, 2019

Nondeterministic Right One-Way Jumping Finite Automata (Extended Abstract).
Proceedings of the Descriptional Complexity of Formal Systems, 2019

Non-Recursive Trade-Offs Are "Almost Everywhere".
Proceedings of the Computing with Foresight and Industry, 2019

2018
On bonded sequential and parallel insertion systems.
RAIRO Theor. Informatics Appl., 2018

Minimal Reversible Deterministic Finite Automata.
Int. J. Found. Comput. Sci., 2018

On the computational complexity of problems related to distinguishability sets.
Inf. Comput., 2018

Selection Via the Bogo-Method - More on the Analysis of Perversely Awful Randomized Algorithms.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

On Minimal Grammar Problems for Finite Languages.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Computational Complexity of Decision Problems on Self-verifying Finite Automata.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

On the Grammatical Complexity of Finite Languages.
Proceedings of the Descriptional Complexity of Formal Systems, 2018

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

The Degree of Irreversibility in Deterministic Finite Automata.
Int. J. Found. Comput. Sci., 2017

Tight Bounds for Cut-Operations on Deterministic Finite Automata.
Fundam. Informaticae, 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

On the Mother of All Automata: The Position Automaton.
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

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.
J. Autom. Lang. Comb., 2016

Editorial.
J. Autom. Lang. Comb., 2016

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

On the Computational Complexity of Partial Word Automata Problems.
Fundam. Informaticae, 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
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. Informaticae, 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

2014
Self-Assembling Pushdown Automata.
J. Autom. Lang. Comb., 2014

Preface.
RAIRO Theor. Informatics Appl., 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

Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes.
Proceedings of the Proceedings 14th International Conference on Automata and Formal Languages, 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

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

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.
J. Autom. Lang. Comb., 2012

On Inverse Operations and Their Descriptional Complexity.
J. Autom. Lang. Comb., 2012

Special Issue: Non-Classical Models of Automata and Applications III (NCMA-2011).
RAIRO Theor. Informatics Appl., 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.
J. Autom. Lang. Comb., 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. Informaticae, 2011

Preface.
Fundam. Informaticae, 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

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

Extending regular expressions with homomorphic replacement.
RAIRO Theor. Informatics Appl., 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

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. Informaticae, 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.
Electron. Colloquium Comput. Complex., 2008

Multi-Head Finite Automata: Characterizations, Concepts and Open Problems
Proceedings of the Proceedings International Workshop on The Complexity of Simple Programs, 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

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.
J. Autom. Lang. Comb., 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. Informaticae, 2007

The Complexity of Tensor Circuit Evaluation.
Comput. Complex., 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

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. Informaticae, 2006

Finding Lower Bounds for Nondeterministic State Complexity is Hard.
Electron. Colloquium Comput. Complex., 2006

Programmed grammars and their relation to the LBA problem.
Acta Informatica, 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<sup>, </sup>.
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. Informaticae, 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.
J. Autom. Lang. Comb., 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).
Bull. EATCS, 2004

Tantrix<sup>TM</sup> rotation puzzles are intractable.
Discret. Appl. Math., 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. Univers. Comput. Sci., 2002

Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components.
J. Autom. Lang. Comb., 2002

The complexity of tensor calculus.
Comput. Complex., 2002

State Complexity of Basic Operations on Nondeterministic Finite Automata.
Proceedings of the Implementation and Application of Automata, 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.
J. Autom. Lang. Comb., 2001

On the Number of Active Symbols in L and CD Grammar Systems.
J. Autom. Lang. Comb., 2001

Improving Raster Image Run-Length Encoding Using Data Order.
Proceedings of the Implementation and Application of Automata, 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

2000
Grammar Systems with Negated Conditions in their Cooperation Protocols
J. Univers. Comput. Sci., 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. Informaticae, 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 <i>k</i>-Head Finite Array Automata.
Proceedings of the Advances in Pattern Recognition, 1998

The Generative Power of <i>d</i>-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

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.
Comput. Artif. Intell., 1996

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

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

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 AC<sup>0</sup>.
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...