Filters








10,092 Hits in 4.0 sec

Equivalence of Extended Symbolic Finite Transducers [chapter]

Loris D'Antoni, Margus Veanes
2013 Lecture Notes in Computer Science  
We then introduce the subclass of Cartesian Extended Symbolic Finite Transducers in which guards are limited to conjunctions of unary predicates.  ...  Finally, we model real world problems with Cartesian Extended Symbolic Finite Transducers and use the equivalence algorithm to prove their correctness.  ...  In our previous work on the topic of analysis of string coders [4] , we introduce Extended Symbolic Finite Automata/Transducers or ESFAs/ESFTs, that add finite lookahead to SFAs/SFTs.  ... 
doi:10.1007/978-3-642-39799-8_41 fatcat:3kdaqeg6dfhi3ff7pmf6njvzb4

The Power of Symbolic Automata and Transducers [chapter]

Loris D'Antoni, Margus Veanes
2017 Lecture Notes in Computer Science  
Symbolic automata and transducers extend finite automata and transducers by allowing transitions to carry predicates and functions over rich alphabet theories, such as linear arithmetic.  ...  Finally, we present a list of open problems and research directions that relate to both the theory and practice of symbolic automata and transducers.  ...  Variants Symbolic finite transducers have been extended in various ways.  ... 
doi:10.1007/978-3-319-63387-9_3 fatcat:whux2ze6xvehbf4vcs7wpbt5di

Symbolic finite state transducers

Margus Veanes, Pieter Hooimeijer, Benjamin Livshits, David Molnar, Nikolaj Bjorner
2012 SIGPLAN notices  
Despite this, the main operations, including composition, checking that a transducer is single-valued, and equivalence checking for single-valued symbolic finite transducers are effective given a decision  ...  We provide novel algorithms for these operations and extend composition to symbolic transducers augmented with registers.  ...  Our first case study extends previous work in using symbolic finite transducers to model web "sanitization functions" [4] .  ... 
doi:10.1145/2103621.2103674 fatcat:udwkx3plhfbz5gjprmf6xsubpm

Symbolic finite state transducers

Margus Veanes, Pieter Hooimeijer, Benjamin Livshits, David Molnar, Nikolaj Bjorner
2012 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '12  
Despite this, the main operations, including composition, checking that a transducer is single-valued, and equivalence checking for single-valued symbolic finite transducers are effective given a decision  ...  We provide novel algorithms for these operations and extend composition to symbolic transducers augmented with registers.  ...  Our first case study extends previous work in using symbolic finite transducers to model web "sanitization functions" [4] .  ... 
doi:10.1145/2103656.2103674 dblp:conf/popl/VeanesHLMB12 fatcat:b5hhsjgqdjgr3n7hu2w7iiinh4

Equivalence of Symbolic Tree Transducers [chapter]

Vincent Hugot, Adrien Boiret, Joachim Niehren
2017 Lecture Notes in Computer Science  
This result can be extended to symbolic DTop with lookahead and thus to deterministic symbolic bottom-up tree transducers. This is an extended version of the paper published at DLT 2017.  ...  In this paper, we show that the equivalence problem of deterministic symbolic top-down tree transducers (DTop) can be reduced to that of classical DTop.  ...  For dealing with data trees, the classical classes of tree transducers were extended to symbolic classes [21, 20, 16] , and similarly for other kinds of finite state machines.  ... 
doi:10.1007/978-3-319-62809-7_7 fatcat:zmfluetdnfeuziejw47oxxkcnq

From Finite-Valued Nondeterministic Transducers to Deterministic Two-Tape Automata [article]

Elisabet Burjons and Fabian Frei and Martin Raszyk
2021 arXiv   pre-print
Finite-valued transducers are those for which there is a finite upper bound on the number of output words that the relation associates with every input word.  ...  In this paper, we examine the analogous problem for finite transducers and automata.  ...  Transducers to Deterministic Two-Tape Automata Definition An NFT T is a finite-valued nondeterministic finite transducer (fv-NFT) if L(T ) is a finite-valued relation.  ... 
arXiv:2005.13710v3 fatcat:prttra4jvjh4nhgpjqmyftvhyy

Properties of Visibly Pushdown Transducers [chapter]

Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2010 Lecture Notes in Computer Science  
Visibly pushdown transducers form a subclass of pushdown transducers that (strictly) extends finite state transducers with a stack.  ...  The proof uses technics of word combinatorics. As a consequence of decidability of functionality, we also show that equivalence of functional visibly pushdown transducers is Exptime-Complete.  ...  Visibly Pushdown Transducers As finite-state transducers extend finite-state automata with outputs, visibly pushdown transducers extend VPAs with outputs.  ... 
doi:10.1007/978-3-642-15155-2_32 fatcat:5habb7auyvgszc6xxchsbddvaq

Symbolic Tree Transducers [chapter]

Margus Veanes, Nikolaj Bjørner
2012 Lecture Notes in Computer Science  
We examine key closure properties of Symbolic Tree Transducers and we develop a composition algorithm and an equivalence decision procedure for linear single-valued transducers.  ...  We define Symbolic Tree Transducers as a generalization of Regular Transducers as finite state input-output tree automata with logical constraints over a parametric background theory.  ...  However, a generalization to the finite-valued case is not expected to be straightforward, because the corresponding generalization of decidability of equivalence for finite-valued tree transducers [31  ... 
doi:10.1007/978-3-642-29709-0_32 fatcat:yzsxuw5yd5bnbocfqwycsyuewq

Multi-tape Automata with Symbol Classes [chapter]

F. Nicart, J. -M. Champarnaud, T. Csáki, T. Gaál, A. Kempe
2006 Lecture Notes in Computer Science  
We propose a new model of finite state machine: multi-tape automata with symbol classes and identity and non-identity constraints (in short M ASCIN ).  ...  This model generalizes both classical single or multi-tape machines, and machines with extended alphabet.  ...  The model of automata and transducers with extended alphabet [9, 1] , originally implemented [8] at Xerox PARC, is based on this notion of a generic symbol that allows the interpretation of the machine  ... 
doi:10.1007/11812128_13 fatcat:2naj4n7cvneffbfae5lkvjpiyq

A Programming Language for Finite State Transducers [chapter]

Helmut Schmid
2006 Lecture Notes in Computer Science  
This paper presents SFST-PL, a programming language for finite state transducers which is based on extended regular expressions with variables.  ...  The programming language is both simple and general and suitable for a wide range of possible applications.  ...  SFST-PL is based on extended regular expressions with variables and supports most operations on finite-state transducers including single character replacement.  ... 
doi:10.1007/11780885_38 fatcat:qz7xxu7gx5bzdi4wns5d4mk6tm

Page 10264 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
Summary: “Finitely subsequential transducers are efficient finite- state transducers with a finite number of final outputs and are used in a variety of applications.  ...  Not all transducers admit equivalent finitely subsequential transducers. We briefly describe an existing For the web version of Mathematical Reviews, see http: //www.ams.org/mathscinet  ... 

:{unav)

Gertjan van Noord, Dale Gerdemann
2012 Grammars  
An extension to finite state transducers is presented, in which atomic symbols are replaced by arbitrary predicates over symbols.  ...  Although the extension is fairly trivial for finite state acceptors, the introduction of predicates is more interesting for transducers.  ...  University of Groningen.  ... 
doi:10.1023/a:1012291501330 fatcat:77cl6c3affgtnizplketgf4pku

Sigma*

Matko Botinčan, Domagoj Babić
2013 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '13  
To represent inferred symbolic models, we use a variant of symbolic transducers that can be effectively composed and equivalence checked.  ...  Sigma * addresses the challenge of synthesizing models of software by using symbolic conjectures and abstraction.  ...  Symbolic finite-state transducers [14] extend finite-state transducers by symbolic transitions, which are defined using predicates for input guards and symbolic terms for output.  ... 
doi:10.1145/2429069.2429123 dblp:conf/popl/BotincanB13 fatcat:zbozefsolbd3nkybvs6fbeulme

Compositions of Top-Down Tree Transducers with ε-Rules [chapter]

Andreas Maletti, Heiko Vogler
2010 Lecture Notes in Computer Science  
Top-down tree transducers with ε-rules (εtdtts) are a restricted version of extended top-down tree transducers.  ...  However, they compute a class of transformations that is not closed under composition (not even for linear and nondeleting εtdtts).  ...  Also, we thank the referees for helpful suggestions, which improved the readability of the paper.  ... 
doi:10.1007/978-3-642-14684-8_8 fatcat:ubsplja76ndlbapawabhta72oa

Iterating Transducers [chapter]

Dennis Dams, Yassine Lakhnech, Martin Steffen
2001 Lecture Notes in Computer Science  
The construction builds a quotient of an underlying infinite-state transducer T <ω , using a novel behavioural equivalence that is based past and future bisimulations computed on finite approximations  ...  In this paper we give a partial algorithm to compute a finite-state transducer T * for a general class of transducers.  ...  Union can be easily extended to the union of countably many transducers. Note that finite union preserves finiteness.  ... 
doi:10.1007/3-540-44585-4_27 fatcat:mevai4bbybafbpns6xi7lkrmyq
« Previous Showing results 1 — 15 out of 10,092 results