Zobrazeno 1 - 10
of 155
pro vyhledávání: '"Gutierrez, Elena"'
Publikováno v:
Fundamenta Informaticae, Volume 184, Issue 1 (December 23, 2021) fi:7402
We provide new insights on the determinization and minimization of tree automata using congruences on trees. From this perspective, we study a Brzozowski's style minimization algorithm for tree automata. First, we prove correct this method relying on
Externí odkaz:
http://arxiv.org/abs/2104.11453
Autor:
Gutiérrez, Elena Pilar, Caserío, Sonia, Jiménez, María Pilar, Castañón, Leticia, Esteban, Inés, Hortelano, Miryam, Hernández, Natalio, Serrano, Marisa, Prada, Tere, Diego, Pablo, Barbadillo, Florentino, Hortigüela, María Montesclaros, Martínez-Biarge, Miriam, Conejo, David, Vega-del-Val, Cristina, Arnaez, Juan
Publikováno v:
In Anales de Pediatria February 2024 100(2):104-114
In this work, we define a framework of automata constructions based on quasiorders over words to provide new insights on the class of residual automata. We present a new residualization operation and a generalized double-reversal method for building
Externí odkaz:
http://arxiv.org/abs/2007.00359
The weight maximization problem (WMP) is the problem of finding the word of highest weight on a weighted finite state automaton (WFA). It is an essential question that emerges in many optimization problems in automata theory. Unfortunately, the gener
Externí odkaz:
http://arxiv.org/abs/2004.06581
In this work we use a framework of finite-state automata constructions based on equivalences over words to provide new insights on the relation between well-known methods for computing the minimal deterministic automaton of a language.
Comment:
Comment:
Externí odkaz:
http://arxiv.org/abs/1906.06194
Autor:
Ganty, Pierre, Gutiérrez, Elena
Parikh's Theorem states that every context-free grammar (CFG) is equivalent to some regular CFG when the ordering of symbols in the words is ignored. The same is not true for the so-called weighted CFGs, which additionally assign a weight to each gra
Externí odkaz:
http://arxiv.org/abs/1810.01351
Autor:
Esteban, Inés, Jiménez, María del Pilar, Serrano, Marisa, Hernández, Natalio, Hortelano, Myriam, Prada, Maria Teresa, Barbadillo, Florentino, Gayte, Pablo Diego, Vega-del-Val, Cristina, Arnaez, Juan, Caserío, Sonia, Gutiérrez, Elena Pilar, Castañón, Leticia, Benito, Marta, Garcia-Alix, Alfredo
Publikováno v:
In Anales de Pediatría (English Edition) July 2022 97(1):30-39
Autor:
Vega-del-Val, Cristina, Arnaez, Juan, Caserío, Sonia, Gutiérrez, Elena Pilar, Castañón, Leticia, Benito, Marta, Garcia-Alix, Alfredo
Publikováno v:
In Anales de Pediatria July 2022 97(1):30-39
Autor:
Ganty, Pierre, Gutiérrez, Elena
We compare pushdown automata (PDAs for short) against other representations. First, we show that there is a family of PDAs over a unary alphabet with $n$ states and $p \geq 2n + 4$ stack symbols that accepts one single long word for which every equiv
Externí odkaz:
http://arxiv.org/abs/1706.08315
Autor:
Fernandez-Cooke, Elisa, Calvo, Cristina, Sánchez-Manubens, Judith, Antón, Jordi, Santos, Javier Aracil, Cuadros, Esmeralda Nuñez, Navarro Gómez, Maria Luisa, Pérez, David Moreno, Cantero Pérez, María Martín, Cuadros Pérez, Esmeralda Nuñez, Gallego Pérez, Begoña Carazo, García, Fernando Sánchez, Lovillo, Marisol Camacho, Marqués, Renata, Laura, Olaf Neth, Silveira, Fernández, Forte, Miguel Sánchez, Montes, Ángeles Ortega, Martínez Campos, Leticia Isabel, Mancheño, Beatriz Bravo, Camacho, Margarita, Medina Claros, Antonio F., Salido, Carlos, Rico, María Torres, Saez, Beatriz Ruiz, de la Puebla Lechuga, Elena Fernadez, a<%2Fce%3Asup>+José+Lirola%22">Cruz, Ma<%2Fce%3Asup>+Ángeles+de+la+Fuente%22">Sánchez, Ma<%2Fce%3Asup>+Soledad+Jiménez%22">Casso, Ma<%2Fce%3Asup>+Mercedes%22">Bueno, M