Minimization of Symbolic Tree Automata

DOI10.1145/2933575.2933578zbMATH Open1401.68159OpenAlexW2500426491WikidataQ131117264 ScholiaQ131117264MaRDI QIDQ4635952FDOQ4635952

Loris D'Antoni, Margus Veanes

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms (68W40) Automata and formal grammars in connection with logical questions (03D05)

Cited In (10)

• Succinct ordering and aggregation constraints in algebraic array theories
• Bisimulation Minimization of Tree Automata
• Simulation algorithms for symbolic automata
• The suffix tree of a tree and minimizing sequential transducers
• Forward Bisimulations for Nondeterministic Symbolic Finite Automata
• Reasoning About Regular Properties: A Comparative Study
• Inferring Symbolic Automata
• The learnability of symbolic automata
• Backward and Forward Bisimulation Minimisation of Tree Automata
• Minimal Ascending and Descending Tree Automata

This page was built for publication: Minimization of Symbolic Tree Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4635952)