Filters








183 Hits in 2.9 sec

On inverse deterministic pushdown transductions

Paul M.B. Vitányi, Walter J. Savitch
1978 Journal of computer and system sciences (Print)  
INTRODUCTION Deterministic pushdown transducers (DPDT's) are deterministic pushdown automata (DPDA's) which h ave been provided with an output tape.  ...  A deterministic cancellation pushdown automaton (DCPDA) .&?  ...  We first present an auxiliary definition and then establish a series of lemmas, one of which, Lemma A2, contains a result on Dyck languages which may be interesting in its own right.  ... 
doi:10.1016/0022-0000(78)90028-4 fatcat:5zvmnwcojvdlroi7g7fkdboydy

The Caucal Hierarchy of Infinite Graphs in Terms of Logic and Higher-Order Pushdown Automata [chapter]

Arnaud Carayol, Stefan Wöhrle
2003 Lecture Notes in Computer Science  
It is obtained by iterating the graph transformations of unfolding and inverse rational mapping.  ...  The first characterization sticks to this hierarchical approach, replacing the languagetheoretic operation of a rational mapping by an MSO-transduction and the unfolding by the treegraph operation.  ...  Thomas for stimulating discussions while working on this paper and for financial support enabling our visits in Aachen respectively Rennes. We also thank T.  ... 
doi:10.1007/978-3-540-24597-1_10 fatcat:hfabghdqxvan5ne5axcsk65exu

Page 5993 of Mathematical Reviews Vol. , Issue 94j [page]

1994 Mathematical Reviews  
Summary: “The class DTTP® [respectively, DTT] is the family of all deterministic top-down tree transductions with deterministic top-down look-ahead [respectively, no look-ahead].  ...  Summary: “In this paper we consider pushdown automata on infinite trees with empty stack as the accepting condition (w- EPDTAs).  ... 

On the Existence of Universal Finite or Pushdown Automata

Manfred Kudlek
2012 Electronic Proceedings in Theoretical Computer Science  
We investigate the (non)-existence of universal automata for some classes of automata, such as finite automata and pushdown automata, and in particular the influence of the representation and encoding  ...  Even linear context-free languages give sets outside CF if a deterministic pushdown transduction is applied.  ...  Contrary to regular languages (REG) which are closed under finite state transductions the contextfree languages (CF) are not closed under pushdown transductions, neither non-deterministic nor deterministic  ... 
doi:10.4204/eptcs.88.7 fatcat:rxzvs2y7x5aabmox34isbw65vm

Visibly pushdown transducers

Emmanuel Filiot, Jean-François Raskin, Pierre-Alain Reynier, Frédéric Servais, Jean-Marc Talbot
2018 Journal of computer and system sciences (Print)  
Visibly pushdown transducers (VPT) extend visibly pushdown automata (VPA) with outputs.  ...  As for VPA, the behavior of the stack is synchronized with the types of input symbols: on reading a call symbol, exactly one stack symbol is pushed onto the stack; on reading a return symbol, exactly one  ...  But some non-deterministic pushdown transductions are not VPT transduction, for instance those non-deterministic pushdown transduction whose domain is a context-free language but not a VPL.  ... 
doi:10.1016/j.jcss.2018.05.002 fatcat:yqiq2kfuwrhvzlnldlpb2qwsii

Tree Transducers and Formal Methods (Dagstuhl Seminar 13192)

Sebastian Maneth, Helmut Seidl, Marc Herbstritt
2013 Dagstuhl Reports  
The 33 participants from 13 countries (Australia, and the US) had been invited by the organizer Sebastian Maneth to give particular survey talks about their recent research on applications and theory of  ...  In particular deterministic two-way transducers capture exactly the class of MSO-transductions of finite strings.  ...  It is also known that this result does not extend to finite string transductions: (deterministic) two-way finite state transducers strictly extend the expressive power of (functional) one-way transducers  ... 
doi:10.4230/dagrep.3.5.1 dblp:journals/dagstuhl-reports/ManethS13 fatcat:xxotqpzgnzc3zdlkk4zxsdot5i

Page 6942 of Mathematical Reviews Vol. , Issue 93m [page]

1993 Mathematical Reviews  
The notions of extended pushdown automaton and of extended pushdown tranducer (which allows one to replace up to k symbols of a pushdown in one step) are formalized in matrix notation by generalizing the  ...  and a morphism) to rational and polynomial pushdown transductions over arbitrary semirings.  ... 

Two-Way Visibly Pushdown Automata and Transducers

Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot
2016 Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science - LICS '16  
two-way transducers, monadic second-order (MSO) transducers, and deterministic one-way automata equipped with a finite number of registers.  ...  The model of visibly pushdown transducers allows to describe such transformations, and we propose a simple deterministic extension of this model with two-way moves that has the following properties: i)  ...  Finally and most importantly, our result allows one to get an extension of a known model of ranked tree to word transductions, to unranked tree to word transductions, namely, deterministic pushdown unranked  ... 
doi:10.1145/2933575.2935315 dblp:conf/lics/DartoisFRT16 fatcat:fm2a46sgxrgr7l5iwf6xtb2dna

Look-ahead on pushdowns

Joost Engelfriet, Heiko Vogler
1987 Information and Computation  
The general notion of look-ahead on pushdowns is used to prove that (1) the deterministic iterated pushdown languages are closed under complementation, (2) the deterministic iterated pushdown languages  ...  Analogous results hold for iterated pushdown automata with regular look-ahead on the input, and Z&regular iterated indexed grammars. cj  ...  J e r} u {stay], id' = stay, andforeveryc'=(~,c)fiwith~~f,c~C,and~~(fxC)*: the class of u-transductions is closed under inverse, it suflices to prove that g(,S) is closed under inverse u-transductions  ... 
doi:10.1016/0890-5401(87)90014-9 fatcat:yqo7xbq65bbohirb5esp7u7y5u

Page 1239 of Mathematical Reviews Vol. 38, Issue 6 [page]

1969 Mathematical Reviews  
The topics discussed are: the Chomsky hierarchy of grammars and languages; the recognition devices: Turing machines, linear bounded automata, pushdown automata (deterministic and non- INFORMATION AND COMMUNICATION  ...  , CIRCUITS, AUTOMATA deterministic, one-way and two-way); normal forms. of context-free grammars and characterizations of context- free languages; subclasses of grammars, languages and automata; ambiguity  ... 

Insertion operations on deterministic reversal-bounded counter machines

Joey Eremondi, Oscar H. Ibarra, Ian McQuillan
2018 Journal of computer and system sciences (Print)  
Several insertion operations are studied applied to languages accepted by one-way and two-way deterministic reversal-bounded multicounter machines.  ...  These operations are defined by the ideals obtained from relations such as the prefix, infix, suffix, and outfix relations, as well as operations defined from inverses of a type of deterministic transducer  ...  DCM is closed under inverse deterministic reversal-bounded counter transductions, and NCM is closed under inverse reversal-bounded counter transductions. Proof.  ... 
doi:10.1016/j.jcss.2018.02.003 fatcat:cmjjhqwzdrdyfos5qyfkivuvfu

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.  ...  Like visibly pushdown automata, the input symbols determine the stack operations. In this paper, we prove that functionality is decidable in PSpace for visibly pushdown transducers.  ...  Along the same line, we study the class of visibly pushdown transductions, a subclass of pushdown transductions, and we show that while extending regular transductions it also preserves desired properties  ... 
doi:10.1007/978-3-642-15155-2_32 fatcat:5habb7auyvgszc6xxchsbddvaq

Reachability in Higher-Order-Counters [chapter]

Alexander Heußner, Alexander Kartzow
2013 Lecture Notes in Computer Science  
on collapsible pushdown graphs.  ...  Recent results focus on algorithmic questions concerning the underlying configuration graphs, e.g., Carayol and Wöhrle [5] showed decidability of the monadic second-order theories of higher-order pushdown  ...  The idea is to encode the pushdown symbol of level k, by the level 1 counter value modulo 3 (recall that P uses the pushdown alphabet {⊥, 0, 1}).  ... 
doi:10.1007/978-3-642-40313-2_47 fatcat:tyqmxynumjdc5fjbaqovqhvh4m

Streamability of nested word transductions

Emmanuel Filiot, Olivier Gauwin, Pierre-Alain Reynier, Frédéric Servais
2019 Logical Methods in Computer Science  
We show that it is decidable in coNPTime for a nested word transduction defined by a visibly pushdown transducer (VPT), if it is HBM.  ...  A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that depends only on the size of T and on the height of the input word.  ...  Acknowledgement The authors would like to thank Jean-François Raskin and Stijn Vansummeren for their comments on a preliminary version of this work.  ... 
doi:10.23638/lmcs-15(2:1)2019 fatcat:h7wvw5rwungdtaw46ai7s3ijoe

Streamability of nested word transductions [article]

Emmanuel Filiot and Olivier Gauwin and Pierre-Alain Reynier and Frédéric Servais
2019 arXiv   pre-print
We show that it is decidable in coNPTime for a nested word transduction defined by a visibly pushdown transducer (VPT), if it is HBM.  ...  A transduction T is said to be height bounded memory (HBM) if it can be evaluated with a memory that depends only on the size of T and on the height of the input word.  ...  Acknowledgement The authors would like to thank Jean-François Raskin and Stijn Vansummeren for their comments on a preliminary version of this work.  ... 
arXiv:1707.00527v3 fatcat:3ojt73s3njfc3cgtkux7mc52zu
« Previous Showing results 1 — 15 out of 183 results