The delta operation: from strings to trees to strings

Authors:
Joost Engelfriet
Affiliations:
LIACS, Leiden University, P.O.Box 9512, 2300 RA Leiden, The Netherlands
Venue:
Formal and natural computing
Year:
2002

Citing 19
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Balanced grammars are a generalization of parenthesis grammars in two directions. First, several kind of parentheses are allowed. Next, the set of right-hand sides of productions may be an infinite regular language. XML-grammars are a special kind of ...