Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings

DOI10.1145/2933575.2934504zbMath1401.68152OpenAlexW2530218450MaRDI QIDQ4635878

Christof Löding, Olivier Serre, Arnaud Carayol

Publication date: 23 April 2018

Published in: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

emptiness problemfiniteness problemautomata on infinite treesautomata with equality and disequality constraints

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25)

Related Items (2)

Unnamed Item ⋮ Projection for Büchi Tree Automata with Constraints between Siblings

This page was built for publication: Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings