APA (7th ed.) Citation
(2013). Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories. Logical Methods in Computer Science.
Chicago Style (17th ed.) Citation
"Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories." Logical Methods in Computer Science 2013.
MLA (9th ed.) Citation
"Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories." Logical Methods in Computer Science, 2013.
Warning: These citations may not always be 100% accurate.