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...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science s. 227 - 236
Hlavní autori:	Carayol, Arnaud, Löding, Christof, Serre, Olivier
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	New York, NY, USA ACM 05.07.2016
Edícia:	ACM Conferences
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!