Filters








637 Hits in 6.7 sec

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  
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.  ...  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.  ...  Acknowledgments We are grateful to the referees for their valuable comments and relevant questions, and we warmly thank Oscar H. Ibarra for pointing out some references.  ... 
doi:10.1007/978-3-642-15155-2_32 fatcat:5habb7auyvgszc6xxchsbddvaq

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  ...  The aim of this Dagstuhl Seminar was to bring together researchers from various research areas related to the theory and application of tree transducers.  ...  XML Stream Processing Based on Tree Transducer Composition Descriptional Complexity of Input-Driven Pushdown Automata It is known that a deterministic automaton equivalent to a nondeterministic IDPDA  ... 
doi:10.4230/dagrep.3.5.1 dblp:journals/dagstuhl-reports/ManethS13 fatcat:xxotqpzgnzc3zdlkk4zxsdot5i

On some decision questions concerning pushdown machines

Oscar H. Ibarra
1983 Theoretical Computer Science  
Exampfes of results shown are the following: (1) There is an aIgorithm to decide given two deterministic pushdown transducers, one of which has a 'finite-turn' counter for a pushdown stack, whether they  ...  ., equivalence, ambiguity, single-valuedrtcss, monotonicity, etc.) concerning pushdown transducers and acceptors are investigated.  ...  r~trodu~tio~ An important unresolved question in forma1 language theory is whether equivalence is decidable for the class of deterministic pushdown automata (DPDAl's).  ... 
doi:10.1016/0304-3975(83)90006-3 fatcat:6pi7tunh75dsrdix4rs6qaqsk4

Two-Way Parikh Automata with a Visibly Pushdown Stack [chapter]

Luc Dartois, Emmanuel Filiot, Jean-Marc Talbot
2019 Green Chemistry and Sustainable Technology  
We finally give applications to decision problems for expressive transducer models from nested words to words, including the equivalence problem.  ...  In this paper, we investigate the complexity of the emptiness problem for Parikh automata equipped with a pushdown stack.  ...  This work was supported by the Belgian FNRS CDR project Flare (J013116), the ARC project Transform (Fédération Wallonie Bruxelles) and by the ANR Project DELTA, ANR-16-CE40-0007.  ... 
doi:10.1007/978-3-030-17127-8_11 dblp:conf/fossacs/DartoisFT19 fatcat:ux3ozqxv3zcofaxodgyualgn5q

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)  
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  ...  Visibly pushdown transducers (VPT) extend visibly pushdown automata (VPA) with outputs.  ...  This work was partially supported by ANR project DELTA, grant ANR-16-CE40-0007, by the ARC project "Transform" (Fédération Wallonie-Bruxelles), and the FNRS CDR project "Flare" J013116F.  ... 
doi:10.1016/j.jcss.2018.05.002 fatcat:yqiq2kfuwrhvzlnldlpb2qwsii

Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words

Christof Löding, Christopher Spinrath
2019 Discrete Mathematics & Theoretical Computer Science  
The procedure is based on a polynomial time regularity test for deterministic visibly pushdown automata, which is a result of independent interest.  ...  We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words, where the problem is decidable.  ...  Acknowledgements We thank the reviewers of the DMTCS journal for their remarks which led to improvements of the presentation, in particular of the proof of Lemma 7.  ... 
doi:10.18154/rwth-2019-08227 fatcat:mowresevybfaphpher3asxajky

Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words [chapter]

Christof Löding, Christopher Spinrath
2017 Lecture Notes in Computer Science  
The procedure is based on a polynomial time regularity test for deterministic visibly pushdown automata, which is a result of independent interest.  ...  We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words, where the problem is decidable.  ...  Acknowledgements We thank the reviewers of the DMTCS journal for their remarks which led to improvements of the presentation, in particular of the proof of Lemma 7.  ... 
doi:10.1007/978-3-662-55751-8_27 fatcat:thldaq34njfgzlq636wi67pqla

Page 3209 of Mathematical Reviews Vol. , Issue 80H [page]

1980 Mathematical Reviews  
The main result of the section shows that the Containment, equivalence and disjointness problems are decidable for transductions defined by deterministic two-way transducers whose inputs come from w?  ...  In contrast with this result we show that the class of languages recognized by one-way deterministic pushdown automata with r weak-counters is ngt closed under complemen- tation for r > 1.”  ... 

Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words [article]

Christof Löding RWTH Aachen University
2019 arXiv   pre-print
The procedure is based on a polynomial time regularity test for deterministic visibly pushdown automata, which is a result of independent interest.  ...  We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the case of finite words, where the problem is decidable.  ...  Acknowledgements We thank the reviewers of the DMTCS journal for their remarks which led to improvements of the presentation, in particular of the proof of Lemma 7.  ... 
arXiv:1803.06140v5 fatcat:cusyl6lo6zcnxp4o5m6bqfj5wq

Visibly Pushdown Transducers with Look-Ahead [chapter]

Emmanuel Filiot, Frédéric Servais
2012 Lecture Notes in Computer Science  
Equivalence, inclusion, emptiness, universality are all decidable.  ...  Pushdown Automaton is a Pushdown Automaton such that: When it reads a call it must push one symbol on the stack.  ... 
doi:10.1007/978-3-642-27660-6_21 fatcat:655lbc7oy5hjdjgphwozyipgym

Page 3266 of Mathematical Reviews Vol. , Issue 81H [page]

1981 Mathematical Reviews  
Heinrich Seidel (Dresden) Blattner, Meera; Head, Tom The decidability of equivalence for deterministic finite transducers. J. Comput. System Sci. 19 (1979), no. 1, 45-49.  ...  The equivalence problem for deterministic pushdown acceptors remains a long-standing, challenging open problem.  ... 

Page 4259 of Mathematical Reviews Vol. , Issue 84j [page]

1984 Mathematical Reviews  
.; Rosier, Louis E. 84j:68052 On the decidability of equivalence for deterministic pushdown transducers. Inform. Process. Lett. 13 (1981), no. 3, 89-93.  ...  “In this paper, we show how aiternate stacking can be used to solve the equivalence problem for certain subclasses of deterministic pushdown transducers.  ... 

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  
Such connections are harder to obtain for transducers, but important results have been obtained recently for word-to-word transformations, showing that the three following models are equivalent: deterministic  ...  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)  ...  The notions of functional, deterministic and unambiguous transducers are naturally defined for these transducers, and we denote by (D)VPT the class of (deterministic) one-way visibly pushdown transducers  ... 
doi:10.1145/2933575.2935315 dblp:conf/lics/DartoisFRT16 fatcat:fm2a46sgxrgr7l5iwf6xtb2dna

Page 1753 of Mathematical Reviews Vol. 52, Issue 5 [page]

1976 Mathematical Reviews  
The construc- tion of pushdown store simulators using techniques related to parallel stacking has been used to show the decidability of the equivalence problem for other subfamilies of the deterministic  ...  The author establishes the decidability of the equivalence problem (do two machines accept the same language?) for deterministic finite-turn pda’s.  ... 

Equivalence of Deterministic Nested Word to Word Transducers [chapter]

Sławomir Staworko, Grégoire Laurence, Aurélien Lemay, Joachim Niehren
2009 Lecture Notes in Computer Science  
We study the equivalence problem of deterministic nested word to word transducers and show it to be surprisingly robust.  ...  Modulo polynomial time reductions, it can be identified with 4 equivalence problems for diverse classes of deterministic non-copying order-preserving transducers.  ...  Since dn2ws can be identified with deterministic pushdown transducer, it follows from the very general result of Szenergues [16] that equivalence of dn2ws is decidable.  ... 
doi:10.1007/978-3-642-03409-1_28 fatcat:4censhk3azdqppd2uhglqteoqe
« Previous Showing results 1 — 15 out of 637 results