How to Remove the Look-Ahead of Top-Down Tree Transducers

DOI10.1007/978-3-319-09698-8_10zbMath1298.68132OpenAlexW1551927956MaRDI QIDQ2921978

Helmut Seidl, Sebastian Maneth, Joost Engelfriet

Publication date: 14 October 2014

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/19464406/Engelfriet_Maneth_ET_AL_2014_How_to_Remove_the_Look_Ahead.pdf

zbMATH Keywords

determinismdecidabilitynormalizationtotalitytop-down tree transducerregular look-ahead

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Related Items

Look-ahead removal for total deterministic top-down tree transducers