Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Mathieu Caralp"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 134, Iss Proc. TTATT 2013, Pp 17-26 (2013)
Visibly pushdown transducers (VPTs) are visibly pushdown automata extended with outputs. They have been introduced to model transformations of nested words, i.e. words with a call/return structure. As trees and more generally hedges can be linearized
Externí odkaz:
https://doaj.org/article/61ac24a267784ee49efa113b8a0673a7
Publikováno v:
Theoretical Computer Science. 578:13-29
We study the problem of trimming visibly pushdown automata (VPA). We first describe a polynomial time procedure which, given a visibly pushdown automaton that accepts only well-nested words, returns an equivalent visibly pushdown automaton that is tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f44767e8377247bf547270995ab14229
https://doi.org/10.1016/j.tcs.2015.01.018
https://doi.org/10.1016/j.tcs.2015.01.018
Autor:
Peter Niebert, Mathieu Caralp
Publikováno v:
Theory and Practice of Natural Computing ISBN: 9783319137483
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0b508b851792713e85591adecba92364
https://doi.org/10.1007/978-3-319-13749-0_2
https://doi.org/10.1007/978-3-319-13749-0_2
Publikováno v:
Implementation and Application of Automata ISBN: 9783642392733
CIAA
CIAA
We study the problem of trimming visibly pushdown automata (VPA). We first describe a polynomial time procedure which, given a visibly pushdown automaton that accepts only well-nested words, returns an equivalent visibly pushdown automaton that is tr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1d32a1d4538815e23080a65483461c61
https://doi.org/10.1007/978-3-642-39274-0_9
https://doi.org/10.1007/978-3-642-39274-0_9
Publikováno v:
Developments in Language Theory ISBN: 9783642316524
Developments in Language Theory
Developments in Language Theory
We propose an extension of visibly pushdown automata by means of weights (represented as positive integers) associated with transitions, called visi- bly pushdown automata with multiplicities. The multiplicity of a computation is the product of the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4b2ea96b14f582198a1e3aae0098526
https://doi.org/10.1007/978-3-642-31653-1_21
https://doi.org/10.1007/978-3-642-31653-1_21