Extended symbolic finite automata and transducers

DOI10.1007/S10703-015-0233-4zbMath1341.68085OpenAlexW830367993MaRDI QIDQ746776

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)

Related Items (3)

Abstract interpretation as automated deduction ⋮ Foundations of Boolean stream runtime verification ⋮ Symbolic automatic relations and their applications to SMT and CHC solving

Uses Software

• Sigma*

Cites Work

• Unnamed Item
• Unnamed Item
• Finite state transducers with predicates and identities
• The equivalence of finite valued transducers (on HDT0L languages) is decidable
• Finite-memory automata
• Data-Parallel String-Manipulating Programs
• Static Analysis of String Encoders and Decoders
• Sigma*
• Symbolic finite state transducers
• The Power of Extended Top-Down Tree Transducers
• Automata and Logics for Words and Trees over an Infinite Alphabet
• 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
• Monadic Decomposition
• Minimization of symbolic automata
• Streaming transducers for algorithmic verification of single-pass list-processing programs
• The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines

This page was built for publication: Extended symbolic finite automata and transducers