## Tag #transducer

### 149 papers:

- CIAA-2019-0001M #composition #linear #top-down
- Composition Closure of Linear Weighted Extended Top-Down Tree Transducers (ZF0, AM), pp. 133–145.
- CIAA-2019-TakahashiAN #streaming #string
- Streaming Ranked-Tree-to-String Transducers (YT, KA, KN), pp. 235–247.
- DLT-2019-YenY #finite
- Characterizing the Valuedness of Two-Way Finite Transducers (DDY, HCY), pp. 100–112.
- CIAA-2018-KonstantinidisM #invariant #regular expression
- Regular Expressions and Transducers over Alphabet-Invariant and User-Defined Labels (SK, NM, RR, JY), pp. 4–27.
- DLT-2018-BaudruR
- From Two-Way Transducers to Regular Function Expressions (NB, PAR), pp. 96–108.
- DLT-2018-GuillonKMP #automaton
- Reversible Pushdown Transducers (BG, MK, AM, LP), pp. 354–365.
- POPL-2018-HolikJLRV #constraints #string
- String constraints with concatenation and transducers solved efficiently (LH, PJ, AWL, PR, TV), p. 32.
- CIAA-2017-GerdjikovMS #finite #functional
- A Simple Method for Building Bimachines from Functional Finite-State Transducers (SG, SM, KUS), pp. 113–125.
- DLT-2017-HugotBN #equivalence
- Equivalence of Symbolic Tree Transducers (VH, AB, JN), pp. 109–121.
- DLT-2017-ZantemaB #permutation #sequence
- Classifying Non-periodic Sequences by Permutation Transducers (HZ, WB), pp. 365–377.
- PLDI-2017-HuD #automation #using
- Automatic program inversion using symbolic transducers (QH, LD), pp. 376–389.
- CAV-2017-DAntoniV #automaton #power of
- The Power of Symbolic Automata and Transducers (LD, MV), pp. 47–67.
- CAV-2017-SaarikiviV
- Minimization of Symbolic Transducers (OS, MV), pp. 176–196.
- VMCAI-2017-BotbolCG #communication #process #static analysis #using
- Static Analysis of Communicating Processes Using Symbolic Transducers (VB, EC, TLG), pp. 73–90.
- CIAA-2016-BenschBK #stack
- Deterministic Stack Transducers (SB, JB, MK), pp. 27–38.
- CIAA-2016-KonstantinidisM #implementation
- Implementation of Code Properties via Transducers (SK, CM, NM, RR), pp. 189–201.
- DLT-2016-Berdinsky #automation
- Cayley Automatic Groups and Numerical Characteristics of Turing Transducers (DB), pp. 26–37.
- DLT-2016-BoiretP #equivalence #linear #polynomial
- Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (AB, RP), pp. 355–367.
- DLT-2016-DartoisJR #string
- Aperiodic String Transducers (LD, IJ, PAR), pp. 125–137.
- POPL-2016-GrathwohlHRST #compilation #named #nondeterminism #streaming
- Kleenex: compiling nondeterministic transducers to deterministic streaming transducers (NBBG, FH, UTR, KAS, SPT), pp. 284–297.
- POPL-2016-LinB #equation #logic #string #towards #word
- String solving with word equations and transducers: towards a logic for analysing mutation XSS (AWL, PB), pp. 123–136.
- CAV-2016-ChenSW #approach #commutative #framework #pipes and filters #problem
- The Commutativity Problem of the MapReduce Framework: A Transducer-Based Approach (YFC, LS, ZW), pp. 91–111.
- ICALP-v2-2015-FiliotMRT #problem
- Decision Problems of Tree Transducers with Origin (EF, SM, PAR, JMT), pp. 209–221.
- CSL-2015-CartonD
- Aperiodic Two-way Transducers and FO-Transductions (OC, LD), pp. 160–174.
- AFL-2014-Maneth #equivalence #overview #problem
- Equivalence Problems for Tree Transducers: A Brief Survey (SM), pp. 74–93.
- CIAA-2014-AmorimMR #canonical #finite #linear #using
- Counting Equivalent Linear Finite Transducers Using a Canonical Form (IA, AM, RR), pp. 70–83.
- CIAA-2014-Ibarra #ambiguity #on the #problem
- On the Ambiguity, Finite-Valuedness, and Lossiness Problems in Acceptors and Transducers (OHI), pp. 211–225.
- CIAA-2014-KurkaV #finite
- Analytic Functions Computable by Finite State Transducers (PK, TV), pp. 252–263.
- CIAA-2014-Maletti #bottom-up #multi #power of
- The Power of Regularity-Preserving Multi Bottom-up Tree Transducers (AM), pp. 278–289.
- DLT-2014-EngelfrietMS #how #top-down
- How to Remove the Look-Ahead of Top-Down Tree Transducers (JE, SM, HS), pp. 103–115.
- DLT-2014-ReynierT #automaton
- Visibly Pushdown Transducers with Well-Nested Outputs (PAR, JMT), pp. 129–141.
- ICALP-v2-2014-Bojanczyk
- Transducers with Origin Information (MB), pp. 26–37.
- LATA-2014-LaurenceLNST #learning
- Learning Sequential Tree-to-Word Transducers (GL, AL, JN, SS, MT), pp. 490–502.
- CIG-2014-Tsang14a #finite #probability
- Comparing the structure of probabilistic 4- and 8-state finite transducer representations for Prisoner's Dilemma (JT), pp. 1–8.
- PLDI-2014-DAntoniVLM #named #performance
- Fast: a transducer-based language for tree manipulation (LD, MV, BL, DM), p. 40.
- ICDAR-2013-HaoGZXPSK #automation #detection #fault #finite
- Automated Error Detection and Correction of Chinese Characters in Written Essays Based on Weighted Finite-State Transducer (SH, ZG, MZ, YX, HP, KS, DK), pp. 763–767.
- VLDB-2013-OgdenTP #automaton #parallel #query #scalability #using #xml
- Scalable XML Query Processing using Parallel Pushdown Transducers (PO, DBT, PP), pp. 1738–1749.
- CIAA-J-2012-Mohri13 #ambiguity #automaton #finite #functional #on the
- On the Disambiguation of Finite Automata and Functional Transducers (MM), pp. 847–862.
- CIAA-2013-Sutner #coordination
- Invertible Transducers, Iteration and Coordinates (KS), pp. 306–318.
- DLT-2013-FulopM #composition #linear #top-down
- Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers (ZF, AM), pp. 239–251.
- LATA-2013-HashimotoSISF #bottom-up
- Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers (KH, RS, YI, HS, TF), pp. 335–346.
- LATA-2013-Souza
- Uniformisation of Two-Way Transducers (RdS), pp. 547–558.
- CIG-2013-Tsang #finite #representation
- The structure of a 3-state finite transducer representation for Prisoner's Dilemma (JT), pp. 1–7.
- CAV-2013-DAntoniV #equivalence #finite
- Equivalence of Extended Symbolic Finite Transducers (LD, MV), pp. 624–639.
- LICS-2013-AlurDT #higher-order #monad #string
- From Monadic Second-Order Definable String Transformations to Transducers (RA, ADG, AT), pp. 458–467.
- LICS-2013-FiliotGRS #finite
- From Two-Way to One-Way Finite State Transducers (EF, OG, PAR, FS), pp. 468–477.
- AFL-J-2011-BenattarBLMRS12 #finite #synthesis
- Channel Synthesis for Finite Transducers (GB, BB, DL, JM, OHR, MS), pp. 1241–1260.
- CIAA-2012-AllauzenR #automaton #library
- A Pushdown Transducer Extension for the OpenFst Library (CA, MR), pp. 66–77.
- CIAA-2012-Mohri #algorithm #ambiguity #automaton #finite #functional
- A Disambiguation Algorithm for Finite Automata and Functional Transducers (MM), pp. 265–277.
- DLT-2012-Carton
- Two-Way Transducers with a Two-Way Output Tape (OC), pp. 263–272.
- ICALP-v2-2012-AlurD #streaming
- Streaming Tree Transducers (RA, LD), pp. 42–53.
- LATA-2012-HundeshagenO
- Characterizing the Rational Functions by Restarting Transducers (NH, FO), pp. 325–336.
- POPL-2012-VeanesHLMB #algorithm #finite
- Symbolic finite state transducers: algorithms and applications (MV, PH, BL, DM, NB), pp. 137–150.
- ICDAR-2011-ChowdhuryGC #finite #online #recognition
- A Weighted Finite-State Transducer (WFST)-Based Language Model for Online Indic Script Handwriting Recognition (SC, UG, TC), pp. 599–602.
- ICDAR-2011-YamazoeEYT #approach #finite #recognition
- Hypothesis Preservation Approach to Scene Text Recognition with Weighted Finite-State Transducer (TY, ME, TY, KT), pp. 359–363.
- PODS-2011-AmelootNB #declarative #network #relational
- Relational transducers for declarative networking (TJA, FN, JVdB), pp. 283–292.
- CIAA-J-2010-AllauzenRS11 #algorithm #composition #finite #performance
- A Filter-Based Algorithm for Efficient Composition of Finite-State Transducers (CA, MR, JS), pp. 1781–1795.
- DLT-J-2010-FrieseSM11 #bottom-up #normalisation
- Earliest Normal Form and Minimization for Bottom-up Tree Transducers (SF, HS, SM), pp. 1607–1623.
- AFL-2011-BenattarBLMRS #finite #synthesis
- Channel Synthesis for Finite Transducers (GB, BB, DL, JM, OHR, MS), pp. 79–92.
- CIAA-2011-Ibarra #equivalence #linear #on the #problem
- On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (OHI), pp. 190–202.
- CIAA-2011-PajicPP #approach #finite #information management
- Information Extraction from Semi-structured Resources: A Two-Phase Finite State Transducers Approach (VP, GPL, MP), pp. 282–289.
- DLT-2011-IbarraY #on the
- On Two-Way Transducers (OHI, HCY), pp. 300–311.
- ICALP-v2-2011-AlurD #nondeterminism #streaming #string
- Nondeterministic Streaming String Transducers (RA, JVD), pp. 1–20.
- ICALP-v2-2011-Zetzsche #automaton #monad #on the
- On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids (GZ), pp. 222–233.
- LATA-2011-LaurenceLNST #normalisation #top-down
- Normalization of Sequential Top-Down Tree-to-Word Transducers (GL, AL, JN, SS, MT), pp. 354–365.
- POPL-2011-AlurC #algorithm #source code #streaming #verification
- Streaming transducers for algorithmic verification of single-pass list-processing programs (RA, PC), pp. 599–610.
- CIAA-2010-AllauzenRS #composition #finite #performance
- Filters for Efficient Composition of Weighted Finite-State Transducers (CA, MR, JS), pp. 28–38.
- DLT-2010-FrieseSM #bottom-up
- Minimization of Deterministic Bottom-Up Tree Transducers (SF, HS, SM), pp. 185–196.
- DLT-2010-Maletti #top-down
- Input Products for Weighted Extended Top-Down Tree Transducers (AM), pp. 316–327.
- ICPR-2010-LlobetCPA #finite #using
- OCR Post-processing Using Weighted Finite-State Transducers (RL, JRCN, JCPC, JA), pp. 2021–2024.
- POPL-2010-KobayashiTU #higher-order #multi #recursion #verification
- Higher-order multi-parameter tree transducers and recursion schemes for program verification (NK, NT, HU), pp. 495–508.
- DATE-2010-LuPRR #energy #performance
- Efficient power conversion for ultra low voltage micro scale energy transducers (CL, SPP, VR, KR), pp. 1602–1607.
- CIAA-J-2008-AllauzenM09 #composition #finite
- N-Way Composition of Weighted Finite-State Transducers (CA, MM), pp. 613–627.
- DLT-2009-Souza #decidability #equivalence #on the
- On the Decidability of the Equivalence for a Certain Class of Transducers (RdS), pp. 478–489.
- LATA-2009-BuchseS #datalog #monad
- Monadic Datalog Tree Transducers (MB, TS), pp. 267–278.
- AFL-2008-Sakarovitch #automaton
- The sequentialisation of automata and transducers (JS), pp. 56–57.
- CIAA-2008-AllauzenM #composition #finite
- 3-Way Composition of Weighted Finite-State Transducers (CA, MM), pp. 262–273.
- CIAA-2008-DolzhenkoJ #2d #complexity #on the
- On Complexity of Two Dimensional Languages Generated by Transducers (ED, NJ), pp. 181–190.
- CIAA-2008-InabaHM #metaprogramming #multi
- Multi-Return Macro Tree Transducers (KI, HH, SM), pp. 102–111.
- DLT-2008-EngelfrietLM #bottom-up #multi
- Extended Multi Bottom-Up Tree Transducers (JE, EL, AM), pp. 289–300.
- DLT-2008-Souza #decidability #equivalence #on the
- On the Decidability of the Equivalence for k-Valued Transducers (RdS), pp. 252–263.
- ICALP-B-2008-RaskinS #automaton
- Visibly Pushdown Transducers (JFR, FS), pp. 386–397.
- SAC-2008-Deba #approach #model transformation #modelling #on the
- On the conformity of models: a transducer-based approach for model transformation (EAD), pp. 791–796.
- ICDAR-2007-KramerKKB #finite #metadata #probability #using
- Bibliographic Meta-Data Extraction Using Probabilistic Finite State Transducers (MK, HK, DK, TMB), pp. 609–613.
- PODS-2007-EngelfrietHS #xml
- XML transformation by tree-walking transducers with invisible pebbles (JE, HJH, BS), pp. 63–72.
- PODS-2007-FanGN #complexity #xml
- Expressiveness and complexity of xml publishing transducers (WF, FG, FN), pp. 83–92.
- CIAA-2007-AllauzenRSSM #finite #library #named #performance
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library (CA, MR, JS, WS, MM), pp. 11–23.
- CIAA-2007-ChamparnaudGF
- Reducing Acyclic Cover Transducers (JMC, FG, JF), pp. 38–50.
- CIAA-2007-Marschner #using
- Efficiently Matching with Local Grammars Using Prefix Overlay Transducers (CM), pp. 314–316.
- CIAA-2007-Paun
- Spiking Neural P Systems Used as Acceptors and Transducers (GP), pp. 1–4.
- LATA-2007-Maletti #composition #top-down
- Compositions of Extended Top-down Tree Transducers (AM), pp. 379–390.
- HCI-MIE-2007-LeePL #finite #multi #recognition
- Multi-word Expression Recognition Integrated with Two-Level Finite State Transducer (KL, KSP, YSL), pp. 124–133.
- TACAS-2007-AbdullaDHR #model checking #performance #verification
- Regular Model Checking Without Transducers (On Efficient Verification of Parameterized Systems) (PAA, GD, NBH, AR), pp. 721–736.
- DLT-2006-SanteanY #ambiguity #finite #on the
- On Weakly Ambiguous Finite Transducers (NS, SY), pp. 156–167.
- FLOPS-2006-Tozawa #type checking #using #xml
- XML Type Checking Using High-Level Tree Transducer (AT), pp. 81–96.
- PLDI-2006-ShiversM #composition #continuation
- Continuations and transducer composition (OS, MM), pp. 295–307.
- FATES-RV-2006-KrichenT #finite #identification #problem
- State-Identification Problems for Finite-State Transducers (MK, ST), pp. 148–162.
- PODS-2005-ManethBPS #metaprogramming #type checking #xml
- XML type checking with macro tree transducers (SM, AB, TP, HS), pp. 283–294.
- DLT-J-2004-Maletti05 #automaton
- Relating tree series transducers and weighted tree automata (AM), pp. 723–741.
- CIAA-2005-Hogberg #generative #music
- Wind in the Willows — Generating Music by Means of Tree Transducers (JH), pp. 153–162.
- CIAA-2005-VielhaberC #infinity #on the #set
- On a Class of Bijective Binary Transducers with Finitary Description Despite Infinite State Set (MV, MdPCC), pp. 356–357.
- DLT-2005-Maletti #power of
- The Power of Tree Series Transducers of Type I and II (AM), pp. 338–349.
- TACAS-2005-AbdullaLdR
- Simulation-Based Iteration of Tree Transducers (PAA, AL, Jd, AR), pp. 30–44.
- CIAA-2004-Borchardt
- Code Selection by Tree Series Transducers (BB), pp. 57–67.
- CIAA-2004-Maletti #theorem
- Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids (AM), pp. 323–324.
- DLT-2004-Maletti #automaton
- Relating Tree Series Transducers and Weighted Tree Automata (AM), pp. 321–333.
- FoSSaCS-2004-ManethB
- Tree Transducers and Tree Compressions (SM, GB), pp. 363–377.
- DLT-2003-Rahonis #automaton
- Alphabetic Pushdown Tree Transducers (GR), pp. 423–436.
- CAV-2003-BoigelotLW #in the large
- Iterating Transducers in the Large (BB, AL, PW), pp. 223–235.
- VLDB-2002-LudascherMP #query #xml
- A Transducer-Based XML Query Processor (BL, PM, YP), pp. 227–238.
- CIAA-J-2000-Mohri02 #algorithm
- Generic e-Removal and Input e-Normalization Algorithms for Weighted Transducers (MM), pp. 129–143.
- CIAA-2002-AllauzenM
- p-Subsequentiable Transducers (CA, MM), pp. 24–34.
- CIAA-2002-GranaAV #compilation #constraints #finite
- Compilation of Constraint-Based Contextual Rules for Part-of-Speech Tagging into Finite State Transducers (JG, GA, JV), pp. 128–137.
- RTA-2002-Voigtlander #composition #performance
- Conditions for Efficiency Improvement by Tree Transducer Composition (JV), pp. 222–236.
- CIAA-2001-FriburgerM #finite
- Finite-State Transducer Cascade to Extract Proper Names in Texts (NF, DM), pp. 115–124.
- CIAA-2001-Gaal #finite #question
- Is this Finite-State Transducer Sequentiable? (TG), pp. 125–134.
- CIAA-2001-Kempe #finite
- Extraction of epsilon-Cyclesfrom Finite-State Transducers (AK), pp. 190–201.
- DLT-2001-EngelfrietM #string
- Hierarchies of String Languages Generated by Deterministic Tree Transducers (JE, SM), pp. 228–238.
- CAV-2001-DamsLS
- Iterating Transducers (DD, YL, MS), pp. 286–297.
- PODS-2000-Spielmann #relational #verification
- Verification of Relational Transducers for Electronic Commerce (MS), pp. 92–103.
- CIAA-2000-Gaal
- Extended Sequentialization of Transducers (TG), pp. 333–334.
- CIAA-2000-Karttunen #finite #natural language
- Applications of Finite-State Transducers in Natural Language Processing (LK), pp. 34–46.
- CIAA-2000-Kempe #ambiguity #finite
- Factorization of Ambiguous Finite-State Transducers (AK), pp. 170–181.
- CIAA-2000-Kempe00a
- Part-of-Speech Tagging with Two Sequential Transducers (AK), pp. 337–339.
- CIAA-2000-MihovM
- Direct Construction of Minimal Acyclic Subsequential Transducers (SM, DM), pp. 217–229.
- ICALP-2000-BealC #infinity #word
- Determinization of Transducers over Infinite Words (MPB, OC), pp. 561–570.
- ICALP-1999-EngelfrietH #finite #higher-order #logic #monad
- Two-Way Finite State Transducers and Monadic Second-Order Logic (JE, HJH), pp. 311–320.
- WIA-1999-Kiraz #finite
- Compressed Storage of Sparse Finite-State Transducers (GAK), pp. 109–121.
- WIA-1999-PaunT #finite #multi
- Multiset Processing by Means of Systems of Finite State Transducers (GP, GT), pp. 140–157.
- FLOPS-1999-Kuhnemann #comparison #deforestation #functional #source code
- Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers (AK), pp. 114–130.
- FoSSaCS-1999-Maneth #metaprogramming #string
- String Languages Generated by Total Deterministic Macro Tree Transducers (SM), pp. 258–272.
- PODS-1998-AbiteboulVFY #relational
- Relational Transducers for Electronic Commerce (SA, VV, BSF, YY), pp. 179–187.
- WIA-1998-Nykanen #using
- Using Acceptors as Transducers (MN), pp. 133–148.
- FoSSaCS-1998-PorrotDDV #random #sequence
- Deterministic Rational Transducers and Random Sequences (SP, MD, BD, NKV), pp. 258–272.
- WIA-1997-MaurelC #pseudo
- Pseudo-minimal Transducers: A Transducer with Proper Elements (DM, LC), pp. 122–132.
- WIA-1997-MohriPR #design #finite #library
- A Rational Design for a Weighted Finite-State Transducer Library (MM, FCNP, MR), pp. 144–158.
- EDTC-1997-RomanowiczLLRABMP #hardware #modelling #simulation #using
- Modeling and simulation of electromechanical transducers in microsystems using an analog hardware description language (BR, ML, PL, PR, HPA, AB, VM, FP), pp. 119–123.
- TAPSOFT-1997-AndreB #bound #difference
- Word-into-Tree Transducers with Bounded Difference (YA, FB), pp. 177–188.
- PODS-1995-MeccaB #datalog #sequence
- Sequences, Datalog and Transducers (GM, AJB), pp. 23–35.
- DLT-1995-Weber #automaton
- Transforming a Single-Valued Transducer Into a Mealy Machine (AW), pp. 176–185.
- TAPSOFT-1995-AndreB #bottom-up #equivalence #problem
- The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable (YA, FB), pp. 155–171.
- TAGT-1994-Drewes #algebra #graph #using
- The Use of Tree Transducers to Compute Translations Between Graph Algebras (FD), pp. 196–210.
- ICALP-1985-EngelfrietV
- Characterization of High Level Tree Transducers (JE, HV), pp. 171–178.
- STOC-1978-EngelfrietRS
- Tree Transducers, L Systems and Two-Way Machines (JE, GR, GS), pp. 66–74.
- ICALP-1977-ChytilJ #composition #finite #source code #string
- Serial Composition of 2-Way Finite-State Transducers and Simple Programs on Strings (MC, VJ), pp. 135–147.
- STOC-1975-Perrault #theorem
- Intercalation Theorems for Tree Transducer Languages (CRP), pp. 126–136.
- STOC-1972-OgdenR #composition
- Compositions of n Tree Transducers (WFO, WCR), pp. 198–206.
- STOC-1971-Rajlich #finite #parallel
- Absolutely Parallel Grammars and Two-Way Deterministic Finite-State Transducers (VR), pp. 132–137.
- STOC-1970-MartinV #on the
- On Syntax-Directed Transduction and Tree Transducers (DFM, SAV), pp. 129–135.