Forward Bisimulations for Nondeterministic Symbolic Finite Automata

DOI10.1007/978-3-662-54577-5_30zbMath1452.68103OpenAlexW2565271321MaRDI QIDQ3303912

Loris D'Antoni, Margus Veanes

Publication date: 5 August 2020

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-54577-5_30

zbMATH Keywords

greedy algorithmfinite automatonfinite alphabetbinary decision diagramdeterministic automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

A symbolic decision procedure for symbolic alternating finite automata ⋮ Unnamed Item

Uses Software

• Symbolic automata
• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
• Finite state transducers with predicates and identities
• Theory of átomata
• DReX
• Symbolic Automata: The Toolkit
• Static Analysis of String Encoders and Decoders
• Advanced automata minimization
• Graph-Based Algorithms for Boolean Function Manipulation
• Three Partition Refinement Algorithms
• New Interpretation and Generalization of the Kameda-Weiner Method.
• Minimization of Symbolic Tree Automata
• Computer Aided Verification
• Monadic second-order logic on finite sequences
• Minimization of symbolic automata
• Implementation and Application of Automata
• On the State Minimization of Nondeterministic Finite Automata
• STACS 2005
• Implementation and Application of Automata

This page was built for publication: Forward Bisimulations for Nondeterministic Symbolic Finite Automata