Derick Wood

Proceedings of the Developments in Language Theory, 1999

Thompson Languages.

[BibT_eX]

Dora Giammarresi

Jean-Luc Ponty

Proceedings of the Jewels are Forever, 1999

The Visual Specification of Context.

[BibT_eX]

[DOI]

Stefan Hermann

Proceedings of the IEEE Forum on Research and Technology Advances in Digital Libraries, 1999

1998

Adaptive Heuristics for Binary Search Trees and Constant Linkage Cost.

[BibT_eX]

[DOI]

SIAM J. Comput., 1998

One-Unambiguous Regular Languages.

[BibT_eX]

[DOI]

Inf. Comput., 1998

Extended Context-Free Grammars and Normal Form Algorithms.

[BibT_eX]

[DOI]

Jürgen Albert

Dora Giammarresi

Proceedings of the Automata Implementation, 1998

A Conceptual Model for Tables.

[BibT_eX]

[DOI]

Xinxin Wang

Proceedings of the Principles of Digital Document Processing, 4th International Workshop, 1998

Context and Caterpillars and Structured Documents.

[BibT_eX]

[DOI]

Stefan Hermann

Proceedings of the Principles of Digital Document Processing, 4th International Workshop, 1998

1997

WIA and Theory and Practice.

[BibT_eX]

[DOI]

Proceedings of the Automata Implementation, 1997

1996

Structural Equivalence and ET0L Grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Fundamentals of Restricted-Orientation Convexity.

[BibT_eX]

[DOI]

Eugene Fink

Inf. Sci., 1996

Relaxed avl trees, main-memory databases and concurrency.

[BibT_eX]

[DOI]

Otto Nurmi

Int. J. Comput. Math., 1996

An adaptive generic sorting algorithm that uses variable partitioning.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 1996

From data representation to data model: Meta-semantic issues in the evolution of SGML.

[BibT_eX]

[DOI]

Darrell R. Raymond

Frank Wm. Tompa

Comput. Stand. Interfaces, 1996

Instruction Computation in Subset Construction.

[BibT_eX]

[DOI]

J. Howard Johnson

Proceedings of the Automata Implementation, 1996

Tabular Formatting Problems.

[BibT_eX]

[DOI]

Xinxin Wang

Proceedings of the Principles of Document Processing, Third International Workshop, 1996

SGML and Exceptions.

[BibT_eX]

[DOI]

Pekka Kilpeläinen

Proceedings of the Principles of Document Processing, Third International Workshop, 1996

O-Convexity Computing Hulls Approximations and Orientation Sets.

[BibT_eX]

[DOI]

V. Martynchik

Nikolai N. Metelski

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Three-dimensional Restricted-Orient at Ion Convexity.

[BibT_eX]

[DOI]

Eugene Fink

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

Generalizing Halfspaces.

[BibT_eX]

[DOI]

Eugene Fink

Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995

Complexity of E0L Structural Equivalence.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

Binary Trees, Fringe Thickness and Minimum Path Length.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

Preset two-head automata and morphological analysis of natural language.

[BibT_eX]

[DOI]

Chet Creider

Jorge Hankamer

Int. J. Comput. Math., 1995

Staircase Visibility and Computation of Kernels.

[BibT_eX]

[DOI]

Sven Schuierer

Algorithmica, 1995

Document Processing, Theory, and Practice (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

Standard Generalized Markup Language: Mathematical and Philosophical Issues.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Today: Recent Trends and Developments, 1995

1994

Balance in AVL Trees and Space Cost of Brother Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1994

Grail: A C++ Library for Automata and Expressions.

[BibT_eX]

[DOI]

Darrell R. Raymond

J. Symb. Comput., 1994

Pumping and Pushdown Machines.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

Updating Approximately Complete Trees.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

Insertion Reachability, Skinny Skeletons, and Path Length in Red-Black Trees.

[BibT_eX]

[DOI]

Inf. Sci., 1994

Maximal Path Length of Binary Trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Foundations for Faster External Sorting (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1994

Rediscovering Pushdown Machines.

[BibT_eX]

[DOI]

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993

Randomized Adative Sorting.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1993

Pm Numbers, Ambiguity, and Regularity.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1993

A Top-Down Updating Algorithm for Weight-Balanced Trees.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

Right Invariant Metrics and Measures of Presortedness.

[BibT_eX]

[DOI]

Heikki Mannila

Discret. Appl. Math., 1993

Interval Heaps.

[BibT_eX]

[DOI]

Comput. J., 1993

Approximate String Matching with Suffix Automata.

[BibT_eX]

[DOI]

Esko Ukkonen

Algorithmica, 1993

On Efficient Entreeings.

[BibT_eX]

[DOI]

Paul S. Amerins

Ricardo A. Baeza-Yates

Acta Informatica, 1993

Structural Equivalences and ET0L Grammars (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

Dent and Staircase Visibility.

[BibT_eX]

Peter Yamamoto

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Generalized Kernels of Polygons with Holes.

[BibT_eX]

Sven Schuierer

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

Data structures, algorithms, and performance.

[BibT_eX]

Addison-Wesley, ISBN: 978-0-201-52148-1, 1993

1992

A Note on the Path Length of Red-Black Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1992

Updating Binary Trees with Constant Linkage Cost.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

A Survey of Adaptive Sorting Algorithms.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1992

A Generic Adaptive Sorting Algorithm.

[BibT_eX]

Comput. J., 1992

Deterministic Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the STACS 92, 1992

1991

Bounded Delay L Codes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Restricted-oriented convex sets.

[BibT_eX]

[DOI]

Inf. Sci., 1991

Defining families of trees with E0L grammars.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

A Relationship Between Self-Organizing Lists and Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing and Information, 1991

Practical Adaptive Sorting.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing and Information, 1991

Balance in AVL Trees.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing and Information, 1991

How Costly Can Red-Black Trees Be?

[BibT_eX]

[DOI]

Proceedings of the Advances in Computing and Information, 1991

A Generalization of Staircase Visibility.

[BibT_eX]

[DOI]

Sven Schuierer

Proceedings of the Computational Geometry, 1991

Sorting, Measures of Disorder, and Worst-Case Performance.

[BibT_eX]

[DOI]

Proceedings of the New Results and New Trends in Computer Science, 1991

1990

A Tight Upper Bound for the Path Length of AVL Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

How to Update a Balanced Binary Tree with a Constant Number of Rotations.

[BibT_eX]

[DOI]

Proceedings of the SWAT 90, 1990

Updating Almost Complete Trees or One Level Makes All the Difference.

[BibT_eX]

[DOI]

Proceedings of the STACS 90, 1990

1989

A New Measure of Presortedness

[BibT_eX]

[DOI]

Inf. Comput., October, 1989

On the path length of binary trees.

[BibT_eX]

[DOI]

J. ACM, 1989

SEPARATION in d dimensions or strip mining in asteroid fields.

[BibT_eX]

[DOI]

Michel P. Devine

Comput. Graph., 1989

A Dynamic Fixed Windowing Problem.

[BibT_eX]

[DOI]

Algorithmica, 1989

On Binary Trees.

[BibT_eX]

Proceedings of the Information Processing 89, Proceedings of the IFIP 11th World Computer Congress, San Francisco, USA, August 28, 1989

1988

Hole Problems for Rectangles in the Plane.

[BibT_eX]

[DOI]

Peter Widmayer

SIAM J. Discret. Math., 1988

On Rectangular Visibility.

[BibT_eX]

[DOI]

Mark H. Overmars

J. Algorithms, 1988

Drawing Trees Nicely with TeX.

[BibT_eX]

Electron. Publ., 1988

The Orthogonal Convex Skull Problem.

[BibT_eX]

[DOI]

Chee-Keng Yap

Discret. Comput. Geom., 1988

Extremal Cost Tree Data Structures.

[BibT_eX]

[DOI]

Proceedings of the SWAT 88, 1988

Implicit Selection.

[BibT_eX]

[DOI]

Proceedings of the SWAT 88, 1988

Voronoi Diagrams Based on General Metrics in the Plane.

[BibT_eX]

[DOI]

Proceedings of the STACS 88, 1988

The increasing role of computer theory in undergraduate curricula.

[BibT_eX]

[DOI]

Proceedings of the 19th SIGCSE Technical Symposium on Computer Science Education, 1988

The Riches of Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Machines, 1988

On the Maximum Path Length of AVL Trees.

[BibT_eX]

[DOI]

Proceedings of the CAAP '88, 1988

1987

The Node Visit Cost of Brother Trees

[BibT_eX]

[DOI]

Inf. Comput., November, 1987

Optimal Computation of Finitely Oriented Convex Hulls

[BibT_eX]

[DOI]

Inf. Comput., February, 1987

Partitioning and separating sets of orthogonal polygons.

[BibT_eX]

[DOI]

Inf. Sci., 1987

Time- and Space-Optimal Contour Computation for a Set of Rectangles.

[BibT_eX]

[DOI]

Peter Widmayer

Inf. Process. Lett., 1987

Concurrency Control in Database Structures with Relaxed Balance.

[BibT_eX]

[DOI]

Otto Nurmi

Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

Variations on Visibility.

[BibT_eX]

[DOI]

J. Ian Munro

Mark H. Overmars

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

Theory of computation.

[BibT_eX]

Wiley, ISBN: 978-0-471-60351-1, 1987

1986

Space-economical plane-sweep algorithms.

[BibT_eX]

[DOI]

Comput. Vis. Graph. Image Process., 1986

Optimal Dynamic Solutions for Fixed Windowing Problems.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985

Search Trees and Bubble Memories.

[BibT_eX]

[DOI]

Philippe Flajolet

RAIRO Theor. Informatics Appl., 1985

Weight-balanced trees are not stratified.

[BibT_eX]

Michael Schrapp

Bull. EATCS, 1985

A fast algorithm for the Boolean masking problem.

[BibT_eX]

[DOI]

Peter Widmayer

Comput. Vis. Graph. Image Process., 1985

Purely Top-Down Updating Algorithms for Stratified Search Trees.

[BibT_eX]

[DOI]

Michael Schrapp

Acta Informatica, 1985

Computing a convex skill of an orthogonal polygon.

[BibT_eX]

[DOI]

Chee-Keng Yap

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Finding Rectangle Intersections by Divide-and Conquer.

[BibT_eX]

[DOI]

Ralf Hartmut Güting

IEEE Trans. Computers, 1984

Minimal-Cost Brother Trees.

[BibT_eX]

[DOI]

Douglas Stott Parker Jr.

Arnold L. Rosenberg

SIAM J. Comput., 1984

Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles.

[BibT_eX]

[DOI]

J. Algorithms, 1984

Computing the Connected Components of Simple Rectilinear Geometrical Objects in D-Space.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1984

Systolic Tree Acceptors.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1984

An Inverse Homomorphic Characterization of Full Principal AFL.

[BibT_eX]

[DOI]

Takashi Yokomori

Inf. Sci., 1984

On the Definition and Computation of Rectlinear Convex Hulls.

[BibT_eX]

[DOI]

Inf. Sci., 1984

The Contour Problem for Rectilinear Polygons.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

Inverse Morphic Equivalence on Languages.

[BibT_eX]

[DOI]

Juhani Karhumäki

Inf. Process. Lett., 1984

Binary search trees with binary comparison cost.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1984

The Complexity and Decidability of Separation.

[BibT_eX]

[DOI]

Bernard Chazelle

Proceedings of the Automata, 1984

1983

A Supernormal-Form Theorem for Context-Free Grammars

[BibT_eX]

[DOI]

J. ACM, January, 1983

L Codes and Number Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1983

Checking Sets, Test Sets, Rich Languages and Commutatively Closed Languages.

[BibT_eX]

[DOI]

Jürgen Albert

J. Comput. Syst. Sci., 1983

Direct dynamic structures for some line segment problems.

[BibT_eX]

[DOI]

Gaston H. Gonnet

J. Ian Munro

Comput. Vis. Graph. Image Process., 1983

Height-Ratio-Balanced Trees.

[BibT_eX]

[DOI]

Gaston H. Gonnet

Henk J. Olivié

Comput. J., 1983

1982

A New Method for Concurrency in B-Trees.

[BibT_eX]

[DOI]

IEEE Trans. Software Eng., 1982

Counting and Reporting Intersections of <i>d</i>-Ranges.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1982

Finitary and Infinitary Interpretations of Languages.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1982

Rectilinear Line Segment Intersection, Layered Segment Trees, and Dynamization.

[BibT_eX]

[DOI]

J. Algorithms, 1982

Dense Hierarchies of Grammatical Families.

[BibT_eX]

[DOI]

J. ACM, 1982

The parenthesis tree.

[BibT_eX]

[DOI]

Ralf Hartmut Güting

Inf. Sci., 1982

A Three-Restricted Normal Form Theorem for ET0L Languages.

[BibT_eX]

[DOI]

Takashi Yokomori

Klaus-Jörn Lange

Inf. Process. Lett., 1982

A Note on Some Tree Similarity Measures.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1982

A comparison of iterative and defined classes of search trees.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1982

The Theory of Fringe Analysis and Its Application to 2-3 Trees and B-Trees

[BibT_eX]

[DOI]

Inf. Control., 1982

Self-regulating L Systems.

[BibT_eX]

Helmut Jürgensen

J. Inf. Process. Cybern., 1982

Stabbing Line Segments.

[BibT_eX]

[DOI]

BIT, 1982

On a Covering Relation for Context-Free Grammars.

[BibT_eX]

[DOI]

Acta Informatica, 1982

An Optimal Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Database Systems, 1982

1981

A Note on Recurrent Words

[BibT_eX]

[DOI]

Inf. Control., October, 1981

On Predecessors of Finite Languages

[BibT_eX]

[DOI]

Inf. Control., September, 1981

On the Complete Simulation of DOL Schemes and Locally Catenative Schemes

[BibT_eX]

[DOI]

Youichi Kobuchi

Inf. Control., April, 1981

Life and Death in Markov Deterministic Tabled OL Systems

[BibT_eX]

[DOI]

Helmut Jürgensen

David E. Matthews

Inf. Control., January, 1981

Dense Multiway Trees.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1981

Uniform Interpretations of Grammar Forms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1981

Completeness of Context-Free Grammar Forms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1981

The Measure Problem for Rectangular Ranges in d-Space.

[BibT_eX]

[DOI]

J. Algorithms, 1981

Synchronized EOL Forms Under Uniform Interpretation.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1981

Sub-Regular Grammar Forms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1981

Cut point languages of markov DTOL systems.

[BibT_eX]

[DOI]

Helmut Jürgensen

David E. Matthews

Int. J. Parallel Program., 1981

Decidability and density in two-symbol grammar forms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

Colorings and interpretations: a connection between graphs and grammar forms.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1981

The implementation of insertion and deletion algorithms for 1-2 brother trees.

[BibT_eX]

[DOI]

Computing, 1981

A Realistic Cost Measure for Binary Search Trees.

[BibT_eX]

Proceedings of the 7th Conference Graphtheoretic Concepts in Computer Science (WG '81), 1981

On Structural Similarity of Context-Free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

1980

MSW Spaces

[BibT_eX]

[DOI]

Inf. Control., September, 1980

Pure Grammars

[BibT_eX]

[DOI]

Inf. Control., January, 1980

Synchronized E0L Forms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1980

An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles.

[BibT_eX]

[DOI]

Jon Louis Bentley

IEEE Trans. Computers, 1980

Context-Free Grammar Forms with Strict Interpretations.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1980

Space and time optimal algorithms for a class of rectangle intersection problems.

[BibT_eX]

[DOI]

Hans-Peter Kriegel

Inf. Sci., 1980

Dynamization of Decomposable Searching Problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

1-2 Brother Trees or AVL Trees Revisited.

[BibT_eX]

[DOI]

Comput. J., 1980

The Rectangle Intersection Problem Revisited.

[BibT_eX]

[DOI]

BIT, 1980

Optimum Multiway Search Trees.

[BibT_eX]

[DOI]

Hans-Peter Kriegel

Acta Informatica, 1980

Context-Free Grammars With Selective Rewriting.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Acta Informatica, 1980

On Generators and Generative Capacity of EOL Forms.

[BibT_eX]

[DOI]

Acta Informatica, 1980

The Analysis of Search Trees: A Survey.

[BibT_eX]

[DOI]

Proceedings of the Graphtheoretic Concepts in Computer Science, 1980

On B-Trees: Routing Schemes and Concurrency.

[BibT_eX]

[DOI]

Proceedings of the 1980 ACM SIGMOD International Conference on Management of Data, 1980

Concurrent Operations in Large Ordered Indexes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Programming, 1980

Approaches to Concurrency in B-Trees.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1980 (MFCS'80), 1980

Grammars and L Forms: An Introduction

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 91, Springer, ISBN: 3-540-10233-7, 1980

1979

A Mathematical Investigation of Propagating Graph 0L Systems

[BibT_eX]

[DOI]

Inf. Control., October, 1979

Context-Dependent L Forms

[BibT_eX]

[DOI]

Inf. Control., July, 1979

Storage Representations for Tree-Like Data Structures.

[BibT_eX]

[DOI]

Arnold L. Rosenberg

Zvi Galil

Math. Syst. Theory, 1979

On Non Context-Free Grammar Forms.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1979

Pure interpretations for EOL forms.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1979

Height balanced 2-3 trees.

[BibT_eX]

[DOI]

Hans-Peter Kriegel

Computing, 1979

One-sided k-height-balanced trees.

[BibT_eX]

[DOI]

Computing, 1979

On the correspondence between AVL trees and brother trees.

[BibT_eX]

[DOI]

Computing, 1979

Node-Visit Optimal 1-2 Brother Trees.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1979

A Survey of Grammar and L Forms-1978.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

A Uniform Approach to Balanced Binary and Multiway Trees.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

1978

Uniform Interpretations of L Forms

[BibT_eX]

[DOI]

Inf. Control., February, 1978

One-sided height-balanced search trees.

[BibT_eX]

[DOI]

SIGACT News, 1978

On Good E0L Forms.

[BibT_eX]

[DOI]

SIAM J. Comput., 1978

ETOL Forms.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1978

Relative Goodness for EOL Forms.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1978

An approach to a unified theory of grammar and L forms.

[BibT_eX]

[DOI]

Inf. Sci., 1978

Speed-varying <sub>OL</sub> systems.

[BibT_eX]

[DOI]

Inf. Sci., 1978

Right Brother Trees.

[BibT_eX]

[DOI]

Commun. ACM, 1978

Precedence Relations in Grammar Forms.

[BibT_eX]

[DOI]

Seymour Ginsburg

Acta Informatica, 1978

1977

Generalized time-delayed OL languages.

[BibT_eX]

[DOI]

Inf. Sci., 1977

Two Variations on n-Parallel Finite State Generators.

[BibT_eX]

[DOI]

Comput. J., 1977

EOL Forms.

[BibT_eX]

[DOI]

Acta Informatica, 1977

1976

Iterated a-NGSM Maps and \Gamma Systems

[BibT_eX]

[DOI]

Inf. Control., September, 1976

A Decomposition Theorem for Hyper-Algebraic Extensions of Language Families.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1976

A Note on K-Iteration Grammars.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Inf. Process. Lett., 1976

Locally Balanced Binary Trees.

[BibT_eX]

[DOI]

A. Walker

Comput. J., 1976

On Grammar Forms with Terminal Context.

[BibT_eX]

[DOI]

Acta Informatica, 1976

1975

Image Theorems for Simple Matrix Languages and n-Parallel Languages.

[BibT_eX]

[DOI]

Robert D. Rosebrugh

Math. Syst. Theory, 1975

Time-delayed OL languages and sequences.

[BibT_eX]

[DOI]

Inf. Sci., 1975

A note on Lindenmayer systems, Szilard languages, spectra, and equivalence.

[BibT_eX]

[DOI]

Int. J. Parallel Program., 1975

Szilard Languages of L-Systems.

[BibT_eX]

Proceedings of the Automata, Languages, Development: At the crossroads of biology, mathematics and computer science, result of an international conference held at Noordwijkerhout, The Netherlands, March 31, 1975

1974

Generative Models for Parallel Processes.

[BibT_eX]

[DOI]

Grzegorz Rozenberg

Comput. J., 1974

Bounded Parallelism and Regular Languages.

[BibT_eX]

[DOI]