Symbolic tree automata

DOI10.1016/j.ipl.2014.11.005zbMath1317.68103OpenAlexW2151788193MaRDI QIDQ483051

Nikolaj Bjørner, Margus Veanes

Publication date: 15 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.11.005

zbMATH Keywords

algorithmsformal methodstree automatalogicsatisfiability modulo theories

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

Unnamed Item ⋮ Weighted Symbolic Automata with Data Storage ⋮ Projection for Büchi Tree Automata with Constraints between Siblings

Uses Software

• MONA
• VATA
• Rex
• MTBDD

Cites Work

• Unnamed Item
• Unnamed Item
• Forward and backward application of symbolic tree transducers
• Finite state transducers with predicates and identities
• VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
• Symbolic finite state transducers
• MONA IMPLEMENTATION SECRETS
• An Evaluation of Automata Algorithms for String Analysis
• An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Symbolic Automata Constraint Solving
• Finite state machines for strings over infinite alphabets
• Minimization of symbolic automata
• Tree Automata over Infinite Alphabets

This page was built for publication: Symbolic tree automata