MSO definable string transductions and two-way finite-state transducers

DOI10.1145/371316.371512zbMath1171.03326MaRDI QIDQ4406290

Joost Engelfriet, Hendrik Jan Hoogeboom

Publication date: 25 June 2003

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/371316.371512

zbMATH Keywords

theory

Mathematics Subject Classification ID

68Q45: Formal languages and automata

03D05: Automata and formal grammars in connection with logical questions

Related Items

Query automata over finite trees