Extended symbolic finite automata and transducers

DOI10.1007/S10703-015-0233-4MaRDI QIDQ746776zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

equivalencesymbolic automatastring encoderssymbolic transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The power of symbolic automata and transducers
• Symbolic finite state transducers: algorithms and applications
• Minimization of symbolic transducers
• Equivalence of finite-valued symbolic finite transducers
• Theoretical aspects of symbolic automata

Cites work

• scientific article; zbMATH DE number 3523154 (Why is no real title available?)
• scientific article; zbMATH DE number 1200800 (Why is no real title available?)
• Automata and Logics for Words and Trees over an Infinite Alphabet
• Data-parallel string-manipulating programs
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• Finite state transducers with predicates and identities
• Finite-memory automata
• Minimization of symbolic automata
• Monadic decomposition
• Sigma*
• Static analysis of string encoders and decoders
• Streaming transducers for algorithmic verification of single-pass list-processing programs
• Symbolic finite state transducers: algorithms and applications
• The Power of Extended Top-Down Tree Transducers
• The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

Cited in

(13)

• The power of symbolic automata and transducers
• Foundations of Boolean stream runtime verification
• Minimization of symbolic transducers
• Symbolic finite state transducers: algorithms and applications
• From sequential extended regular expressions to NFA with symbolic labels
• Symbolic register automata
• Completeness in approximate transduction
• Equivalence of finite-valued symbolic finite transducers
• Implementation of code properties via transducers
• A symbolic decision procedure for symbolic alternating finite automata
• Abstract interpretation as automated deduction
• Symbolic automatic relations and their applications to SMT and CHC solving
• Symbolic automata: the toolkit

Describes a project that uses

Uses Software

• Sigma*

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)