Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings

This article is inspired by two works from the early 90s. The first one is by Bogaert and Tison who considered a model of automata on finite ranked trees where one can check equality and disequality constraints between direct subtrees: they proved that this class of automata is closed under Boolean...

Full description

Bibliographic Details

Published in:	Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science pp. 227 - 236
Main Authors:	Carayol, Arnaud, Löding, Christof, Serre, Olivier
Format:	Conference Proceeding
Language:	English
Published:	New York, NY, USA ACM 05.07.2016
Series:	ACM Conferences
Subjects:	Theory of computation Theory of computation > Formal languages and automata theory Theory of computation > Logic Automata on infinite trees Automata with equality and disequality constraints Emptiness problem Finiteness problem
ISBN:	9781450343916, 1450343910
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!