## 10 Citations

Structural Equivalence of Regularly Extended E0L Grammars: An Automata Theoretic Proof

- Computer ScienceTheory Is Forever
- 2004

It is shown that structural equivalence remains decidable for regularly extended E0L grammars.

Structural Equivalences and ET0L Grammars (Extended Abstract)

- Computer ScienceFCT
- 1993

It is shown that structural equivalence is undecidable for propagating ET0L grammars even when the number of tables is restricted to be at most two, in contrast to the decidability result for the E0L case.

A normal form for structurally equivalent E0L grammars

- Geology
- 1992

A normal form for structurally equivalent E0L grammars is constructed. Two E0L grammars are structurally equivalent iff the respective normal form grammars are isomorphic. This result gives also a…

Complexity of E0L Structural Equivalence

- Computer Science, MathematicsRAIRO Theor. Informatics Appl.
- 1995

We show that the EOL structural equivalence problem is logspace hard for deterministic exponential time. Also, we show that this question can be solved in linear space by a synchronized alternating…

Structural Equivalence and Et0l Grammars X Structural Equivalence and Et0l Grammars 1

- Linguistics
- 1996

For a given context-sensitive grammar G we construct ET0L grammars G 1 and G 2 that are structurally equivalent if and only if the language generated by G is empty, which implies that structural…

Simplifications of E0L Grammars

- Computer Science
- 1992

It is established that some simplification results for E0L grammars that preserve their structure are sufficient to solve the structural equivalence problem, but this does not hold in the context-free case.

## References

SHOWING 1-10 OF 13 REFERENCES

(g 0, g 1, ... g k)-Trees and Unary OL Systems

- Computer Science, MathematicsTheor. Comput. Sci.
- 1983

The mathematical theory of L systems

- Mathematics
- 1980

A survey of the different areas of the theory of developmental systems and languages in such a way that it discusses typical results obtained in each particular problem area.

Implementing Dictionaries Using Binary Trees of Very Small Height

- Computer ScienceInf. Process. Lett.
- 1976

Simplifications of E0L Grammars

- Computer Science
- 1992

It is established that some simplification results for E0L grammars that preserve their structure are sufficient to solve the structural equivalence problem, but this does not hold in the context-free case.

Data Structures and Algorithms

- Computer Science
- 1983

The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.

On Equality of Multiplicity Sets of Regular Languages

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 1985

Parenthesis Grammars

- LinguisticsJACM
- 1967

A decision procedure is given which determines whether the languages defined by two parenthesis grammars are equal.

Ruohonen , On equality of multiplicity sets of regular languages , Theoret

- Comput . Sci .
- 1980

A study of balanced binary trees and balanced one-two trees, Ph.D Thesis, Departement Wiskunde

- 1980