The Delta Operation: From Strings to Trees to Strings

Authors:
Joost Engelfriet
Affiliations:
-
Venue:
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Year:
2002

Citing 23
Cited 0

Hierarchies of hyper-AFLs

Journal of Computer and System Sciences
An automata-theoretical characterization of the OI-hierarchy

Information and Control
Pushdown machines for the macro tree transducer

Theoretical Computer Science
Look-ahead pushdowns

Information and Computation
The OI-hierarchy is closed under control

Information and Computation
High level tree transducers and iterated pushdown tree transducers

Acta Informatica
The equivalence problem of multitape finite automata

Theoretical Computer Science
Iterated stack automata and complexity classes

Information and Computation
X-automata on &ohgr;-words

Theoretical Computer Science
L systems

Handbook of formal languages, vol. 1
Tree languages

Handbook of formal languages, vol. 3
On the representation of finite deterministic 2-tape automata

Theoretical Computer Science
Indexed Grammars—An Extension of Context-Free Grammars

Journal of the ACM (JACM)
Stack Machines and Classes of Nonnested Macro Languages

Journal of the ACM (JACM)
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages

Journal of the ACM (JACM)
Algebraic and Automata-Theoretic Properties of Formal Languages

Algebraic and Automata-Theoretic Properties of Formal Languages
Mathematical Theory of L Systems

Mathematical Theory of L Systems
Hyper-AFL's and ET0L Systems

L Systems, Most of the papers were presented at a conference in Aarhus, Denmark
An algebraic formulation of the Chomsky hierarchy

Proceedings of the Proceedings of the First International Symposium on Category Theory Applied to Computation and Control
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
Finite automata and their decision problems

IBM Journal of Research and Development
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory

Journal of Computer and System Sciences
Some definitional suggestions for automata theory

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

The delta of a language L consists of the yields of trees of which all paths are in L. The context-free languages are the deltas of the regular languages. The indexed languages are the deltas of the deterministic context-free languages. In general, the nondeterministic (n + 1)-iterated pushdown languages are the deltas of the deterministic n- iterated pushdown languages. The recursively enumerable languages are the deltas of the context-free languages. The delta of a string relation R consists of the yields of trees of which all paths are in the R-image of one string. The ET0L languages are the deltas of the relations recognized by deterministic two-tape finite automata. The recursively enumerable languages are the deltas of the finite state transductions.