| Publication | Date of Publication | Type |
|---|
| Rediscovering pushdown machines | 2024-01-29 | Paper |
| How to update a balanced binary tree with a constant number of rotations | 2022-12-09 | Paper |
| Deterministic regular languages | 2022-08-18 | Paper |
| Complexity of EOL structural equivalence | 2022-08-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3655366 | 2010-01-07 | Paper |
| Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages | 2009-05-22 | Paper |
| Prime Decompositions of Regular Languages | 2009-03-26 | Paper |
| Generalizations of 1-deterministic regular languages | 2008-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517103 | 2008-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5445181 | 2008-03-03 | Paper |
| Overlap-Free Regular Languages | 2007-09-10 | Paper |
| On the existence of prime decompositions | 2007-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3429640 | 2007-04-02 | Paper |
| Obtaining shorter regular expressions from finite-state automata | 2007-02-26 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| Theoretical Aspects of Computing – ICTAC 2005 | 2006-11-01 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| THE GENERALIZATION OF GENERALIZED AUTOMATA: EXPRESSION AUTOMATA | 2005-08-01 | Paper |
| THE REGULARITY OF TWO-WAY NONDETERMINISTIC TREE AUTOMATA LANGUAGES | 2005-06-22 | Paper |
| Theory Is Forever | 2005-01-18 | Paper |
| PLANAR STRONG VISIBILITY | 2004-09-29 | Paper |
| On the state complexity of reversals of regular languages | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474153 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470523 | 2004-07-01 | Paper |
| Restricted-orientation convexity. | 2004-03-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448365 | 2004-02-18 | Paper |
| A characterization of Thompson digraphs. | 2004-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418621 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413782 | 2003-07-21 | Paper |
| Multiple-guard kernels of simple polygons | 2003-02-24 | Paper |
| SGML and XML document grammars and exceptions | 2003-01-14 | Paper |
| An adaptive generic sorting algorithm that uses variable partitioning∗ | 2002-12-19 | Paper |
| Relaxed avl trees, main-memory databases and concurrency | 2002-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4540957 | 2002-07-28 | Paper |
| Normal form algorithms for extended context-free grammars | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708971 | 2001-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941144 | 2000-09-26 | Paper |
| Calculation of partially convex hulls and approximations for finite planar sets | 2000-07-30 | Paper |
| \textit{Grail}: A C++ library for automata and expressions | 2000-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955249 | 2000-05-25 | Paper |
| Generalized halfspaces in restricted-orientation convexity | 1999-10-06 | Paper |
| One-unambiguous regular languages | 1998-11-10 | Paper |
| Strong restricted-orientation convexity | 1998-11-09 | Paper |
| Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost | 1998-09-21 | Paper |
| One-unambiguous regular languages | 1998-09-08 | Paper |
| Visibility in semi-convex spaces | 1998-08-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4376790 | 1998-02-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4376806 | 1998-02-11 | Paper |
| Fundamentals of restricted-orientation convexity | 1997-12-17 | Paper |
| Pumping and pushdown machines | 1997-10-30 | Paper |
| Updating approximately complete trees | 1997-10-30 | Paper |
| The validation of SGML content models | 1997-10-26 | Paper |
| Complexity of E0L structural equivalence | 1997-10-08 | Paper |
| Structural equivalence and ET0L grammars | 1997-02-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4864246 | 1996-01-30 | Paper |
| Binary trees, fringe thickness and minimum path length | 1995-10-09 | Paper |
| Maximal path length of binary trees | 1995-09-19 | Paper |
| Staircase visibility and computation of kernels | 1995-07-24 | Paper |
| A TOP-DOWN UPDATING ALGORITHM FOR WEIGHT-BALANCED TREES | 1995-01-12 | Paper |
| Balance in AVL trees and space cost of brother trees | 1995-01-11 | Paper |
| Insertion reachability, skinny skeletons, and path length in red-black trees | 1994-07-26 | Paper |
| On efficient entreeings | 1994-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284264 | 1994-04-17 | Paper |
| Approximate string matching with suffix automata | 1994-01-19 | Paper |
| Pm numbers, ambiguity, and regularity | 1993-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138941 | 1993-10-20 | Paper |
| Interval Heaps | 1993-08-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4692941 | 1993-06-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035765 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036764 | 1993-05-18 | Paper |
| UPDATING BINARY TREES WITH CONSTANT LINKAGE COST | 1993-05-16 | Paper |
| Randomized adaptive sorting | 1993-05-16 | Paper |
| Right invariant metrics and measures of presortedness | 1993-05-16 | Paper |
| A note on the path length of red-black trees | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3973281 | 1992-06-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3981723 | 1992-06-26 | Paper |
| Bounded delay L codes | 1992-06-26 | Paper |
| Defining families of trees with E0L grammars | 1992-06-26 | Paper |
| Restricted-oriented convex sets | 1992-06-25 | Paper |
| A tight upper bound for the path length of AVL trees | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3355224 | 1990-01-01 | Paper |
| On the path length of binary trees | 1989-01-01 | Paper |
| A new measure of presortedness | 1989-01-01 | Paper |
| A dynamic fixed windowing problem | 1989-01-01 | Paper |
| A decompositin theorem for convexity spaces | 1989-01-01 | Paper |
| Hole Problems for Rectangles in the Plane | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789085 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3794819 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796310 | 1988-01-01 | Paper |
| On rectangular visibility | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796767 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3796772 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3800653 | 1988-01-01 | Paper |
| A note on the largest empty rectangle problem | 1988-01-01 | Paper |
| The orthogonal convex skull problem | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785961 | 1987-01-01 | Paper |
| Partitioning and separating sets of orthogonal polygons | 1987-01-01 | Paper |
| The node visit cost of brother trees | 1987-01-01 | Paper |
| Time-and space-optimal contour computation for a set of rectangles | 1987-01-01 | Paper |
| Optimal computation of finitely oriented convex hulls | 1987-01-01 | Paper |
| Denseness, maximality, and decidability of grammatical families | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4725770 | 1986-01-01 | Paper |
| A simple proof of the rectilinear art gallery theorem | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3686051 | 1985-01-01 | Paper |
| A fast algorithm for the Boolean masking problem | 1985-01-01 | Paper |
| A worst-case efficient algorithm for hidden-line elimination† | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4721677 | 1985-01-01 | Paper |
| Purely top-down updating algorithms for stratified search trees | 1985-01-01 | Paper |
| Erratum to: ``A three-restricted normal form theorem for ETOL languages | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3687724 | 1984-01-01 | Paper |
| The contour problem for rectilinear polygons | 1984-01-01 | Paper |
| On the definition and computation of rectilinear convex hulls | 1984-01-01 | Paper |
| An inverse homomorphic characterization of full principal AFL | 1984-01-01 | Paper |
| Inverse morphic equivalence on languages | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3217599 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3323237 | 1984-01-01 | Paper |
| Finding Rectangle Intersections by Divide-and-Conquer | 1984-01-01 | Paper |
| Binary search trees with binary comparison cost | 1984-01-01 | Paper |
| Optimal algorithms to compute the closure of a set of iso-rectangles | 1984-01-01 | Paper |
| Height-Ratio-Balanced Trees | 1983-01-01 | Paper |
| A Supernormal-Form Theorem for Context-Free Grammars | 1983-01-01 | Paper |
| Adjudicating a towers of hanoi contest† | 1983-01-01 | Paper |
| Direct dynamic structures for some line segment problems | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4741930 | 1983-01-01 | Paper |
| On finite grammar forms | 1983-01-01 | Paper |
| L codes and number systems | 1983-01-01 | Paper |
| Checking sets, test sets, rich languages and commutatively closed languages | 1983-01-01 | Paper |
| The multiway trees of hanoi† | 1983-01-01 | Paper |
| Finitary and infinitary interpretations of languages | 1982-01-01 | Paper |
| The theory of fringe analysis and its application to 23 trees and b-trees | 1982-01-01 | Paper |
| Counting and Reporting Intersections of d-Ranges | 1982-01-01 | Paper |
| Encoding search trees in lists† | 1982-01-01 | Paper |
| Rectilinear line segment intersection, layered segment trees, and dynamization | 1982-01-01 | Paper |
| A New Method for Concurrency in B-Trees | 1982-01-01 | Paper |
| A comparison of iterative and defined classes of search trees | 1982-01-01 | Paper |
| Dense Hierarchies of Grammatical Families | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959474 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3959475 | 1982-01-01 | Paper |
| On a covering relation for context-free grammars | 1982-01-01 | Paper |
| A three-restricted normal form theorem for ETOL languages | 1982-01-01 | Paper |
| Stabbing line segments | 1982-01-01 | Paper |
| A note on some tree similarity measures | 1982-01-01 | Paper |
| The parenthesis tree | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3318119 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3335001 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4745281 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4747528 | 1981-01-01 | Paper |
| The construction of optimal multiway search trees and the monotonicity principle | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3902504 | 1981-01-01 | Paper |
| Dense multiway trees | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912046 | 1981-01-01 | Paper |
| Life and death in Markov deterministic tabled OL systems | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3928259 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3933777 | 1981-01-01 | Paper |
| Derivation languages of grammar forms† | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3946175 | 1981-01-01 | Paper |
| The measure problem for rectangular ranges in d-space | 1981-01-01 | Paper |
| On the complete simulation of DOL schemes and locally catenative schemes | 1981-01-01 | Paper |
| A note on recurrent words | 1981-01-01 | Paper |
| Uniform Interpretations of Grammar Forms | 1981-01-01 | Paper |
| Cut point languages of markov DTOL systems | 1981-01-01 | Paper |
| Algorithm 43. The implementation of insertion and deletion algorithms for 1-2 brother trees | 1981-01-01 | Paper |
| Colorings and interpretations: a connection between graphs and grammar forms | 1981-01-01 | Paper |
| Sub-regular grammar forms | 1981-01-01 | Paper |
| Completeness of context-free grammar forms | 1981-01-01 | Paper |
| Decidability and density in two-symbol grammar forms | 1981-01-01 | Paper |
| On predecessors of finite languages | 1981-01-01 | Paper |
| 1-2 Brother Trees or AVL Trees Revisited | 1980-01-01 | Paper |
| Pure grammars | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3902461 | 1980-01-01 | Paper |
| MSW spaces | 1980-01-01 | Paper |
| Grammar and L forms: an introduction | 1980-01-01 | Paper |
| Synchronized EOL forms | 1980-01-01 | Paper |
| Context-free grammar forms with strict interpretations | 1980-01-01 | Paper |
| Optimum multiway search trees | 1980-01-01 | Paper |
| Context-free grammars with selective rewriting | 1980-01-01 | Paper |
| On generators and generative capacity of EOL forms | 1980-01-01 | Paper |
| Space and time optimal algorithms for a class of rectangle intersection problems | 1980-01-01 | Paper |
| Doubly deterministic tabled OL systems | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3873566 | 1979-01-01 | Paper |
| Storage representations for tree-like data structures | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4190153 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4192988 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4198076 | 1979-01-01 | Paper |
| Height balanced 2-3 trees | 1979-01-01 | Paper |
| One-sided k-height-balanced trees | 1979-01-01 | Paper |
| On the correspondence between AVL trees and brother trees | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3051375 | 1979-01-01 | Paper |
| On non context-free grammar forms | 1979-01-01 | Paper |
| A mathematical investigation of propagating graph 0L systems | 1979-01-01 | Paper |
| Context-dependent L forms | 1979-01-01 | Paper |
| Uniform interpretations of L forms | 1978-01-01 | Paper |
| On Good EOL Forms | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4160425 | 1978-01-01 | Paper |
| A comparison of two methods of encoding arrays | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4170258 | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4174779 | 1978-01-01 | Paper |
| Right brother trees | 1978-01-01 | Paper |
| 2–3 brother trees | 1978-01-01 | Paper |
| Speed-varying OL systems | 1978-01-01 | Paper |
| An approach to a unified theory of grammar and L forms | 1978-01-01 | Paper |
| ETOL forms | 1978-01-01 | Paper |
| Precedence relations in grammar forms | 1978-01-01 | Paper |
| Two variations on n-parallel finite state generators | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138170 | 1977-01-01 | Paper |
| Pyramids: A data type for matrix representation in Pascal | 1977-01-01 | Paper |
| EOL forms | 1977-01-01 | Paper |
| Generalized time-delayed OL languages | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4079070 | 1976-01-01 | Paper |
| A note on a family of acceptors for some families of developmental languages† | 1976-01-01 | Paper |
| Iterated a-NGSM maps and Γ systems | 1976-01-01 | Paper |
| On grammar forms with terminal context | 1976-01-01 | Paper |
| A note on K-iteration grammars | 1976-01-01 | Paper |
| A decomposition theorem for hyper-algebraic extensions of language families | 1976-01-01 | Paper |
| A note on Lindenmayer systems, Szilard languages, spectra, and equivalence | 1975-01-01 | Paper |
| Image theorems for simple matrix languages andn-parallel languages | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4089800 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4105805 | 1975-01-01 | Paper |
| Time-delayed OL languages and sequences | 1975-01-01 | Paper |
| Generative Models for Parallel Processes | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4066631 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4766065 | 1973-01-01 | Paper |
| Bicolored digraph grammar systems | 1973-01-01 | Paper |
| Some remarks on the KH algorithm fors-grammars | 1973-01-01 | Paper |
| A characterization theorem for n-parallel right linear languages | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3212686 | 1973-01-01 | Paper |
| A factor theorem for subsets of a free monoid | 1972-01-01 | Paper |
| Errata | 1971-01-01 | Paper |
| A further note on top-down deterministic languages | 1971-01-01 | Paper |
| The theory of left factored languages: part 2 | 1970-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5604903 | 1970-01-01 | Paper |
| A generalised normal form theorem for context-free grammars | 1970-01-01 | Paper |
| A proof of Hamblin's algorithm for translation of arithmetic expressions from infix to postfix form | 1969-01-01 | Paper |
| The normal form theorem--another proof | 1969-01-01 | Paper |
| The theory of left factored languages: Part 1 | 1969-01-01 | Paper |
| A note on top-down deterministic languages | 1969-01-01 | Paper |
