Extended symbolic finite automata and transducers
From MaRDI portal
Publication:746776
DOI10.1007/S10703-015-0233-4zbMATH Open1341.68085OpenAlexW830367993MaRDI QIDQ746776FDOQ746776
Authors: Loris D'Antoni, Margus Veanes 
Publication date: 20 October 2015
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-015-0233-4
Recommendations
Cites Work
- Sigma*
- The equivalence of finite valued transducers (on HDT0L languages) is decidable
- Symbolic finite state transducers
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Streaming transducers for algorithmic verification of single-pass list-processing programs
- Title not available (Why is that?)
- Finite-memory automata
- Decomposing Finite-Valued Transducers and Deciding Their Equivalence
- The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
- The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
- Minimization of symbolic automata
- Finite state transducers with predicates and identities
- The Power of Extended Top-Down Tree Transducers
- Data-parallel string-manipulating programs
- Static Analysis of String Encoders and Decoders
- Title not available (Why is that?)
- Monadic Decomposition
Cited In (6)
- Foundations of Boolean stream runtime verification
- A symbolic decision procedure for symbolic alternating finite automata
- Symbolic automatic relations and their applications to SMT and CHC solving
- From sequential extended regular expressions to NFA with symbolic labels
- Symbolic automata: the toolkit
- Abstract interpretation as automated deduction
Uses Software
This page was built for publication: Extended symbolic finite automata and transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q746776)
