Extended symbolic finite automata and transducers
type: Item
instance of: scholarly article
title: Extended symbolic finite automata and transducers
zbMATH Open document ID: 1341.68085
author: Loris D'Antoni
author: Margus Veanes
published in: Formal Methods in System Design
publication date: 2015-10-20T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6496666
zbMATH Keywords: symbolic automata
zbMATH Keywords: symbolic transducers
zbMATH Keywords: equivalence
zbMATH Keywords: string encoders
describes a project that uses: Sigma*
MaRDI profile type: Publication
full work available at URL: s10703-015-0233-4
OpenAlex ID: W830367993
cites work: Streaming transducers for algorithmic verification of single-pass list-processing programs
cites work: Sigma*
cites work: The equivalence of finite valued transducers (on HDT0L languages) is decidable
cites work: The Power of Extended Top-Down Tree Transducers
cites work: Finite-memory automata
cites work: Static Analysis of String Encoders and Decoders
cites work: Minimization of symbolic automata
cites work: The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines
cites work: Q4210160
cites work: The Unsolvability of the Equivalence Problem for $\varepsilon $-Free NGSM’s with Unary Input (Output) Alphabet and Applications
cites work: Finite state transducers with predicates and identities
cites work: Q4101446
cites work: Automata and Logics for Words and Trees over an Infinite Alphabet
cites work: Monadic Decomposition
cites work: Symbolic finite state transducers
cites work: Data-parallel string-manipulating programs
cites work: Decomposing Finite-Valued Transducers and Deciding Their Equivalence
DOI: 10.1007/S10703-015-0233-4
description: scientific article; zbMATH DE number 6496666