Hierarchies of string languages generated by deterministic tree transducers

DOI10.1007/3-540-46011-X_19MaRDI QIDQ4737910zbMATH OpenFDO

Authors Sebastian Maneth, Joost Engelfriet

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2295/22950228.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Output string languages of compositions of deterministic macro tree transducers
• String languages generated by total deterministic macro tree transducers
• The complexity of compositions of deterministic tree transducers
• scientific article; zbMATH DE number 3965457
• The generating power of total deterministic tree transducers

Cited in

(5)

• The generating power of total deterministic tree transducers
• Output string languages of compositions of deterministic macro tree transducers
• String languages generated by total deterministic macro tree transducers
• The complexity of compositions of deterministic tree transducers
• A rank hierarchy for deterministic tree-walking transducers

This page was built for publication: Hierarchies of string languages generated by deterministic tree transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737910)