Logic-automata connections for transformations

DOI10.1007/978-3-662-45824-2_3MaRDI QIDQ2937387zbMATH OpenOpenAlexFDO

Authors Emmanuel Filiot

Publication date 9 January 2015

Published in Logic and Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-45824-2_3

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05)

Recommendations

• scientific article; zbMATH DE number 5872401
• Logic, semigroups and automata on words
• scientific article; zbMATH DE number 1948151
• scientific article; zbMATH DE number 2038699
• Two-way visibly pushdown automata and transducers

Cited in

(11)

• Thompson transformations for IF-logic
• Aperiodic string transducers
• scientific article; zbMATH DE number 2016096 (Why is no real title available?)
• scientific article; zbMATH DE number 2038699 (Why is no real title available?)
• Aperiodic string transducers
• A logical representation of extension transformation
• scientific article; zbMATH DE number 7559499 (Why is no real title available?)
• On canonical models for rational functions over infinite words
• Synthesis of computable regular functions of infinite words
• Automated Deduction – CADE-19
• Synthesizing Computable Functions from Rational Specifications Over Infinite Words

This page was built for publication: Logic-automata connections for transformations

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