communications.bib

@INPROCEEDINGS{ecdl05:Sanchez+Gonzalez+Carrasco,
  AUTHOR = {Enrique Sánchez Villamil and Carlos González Muñoz and
                  Rafael C. Carrasco},
  TITLE = {XMLibrary Search: An XML Search Engine Oriented to Digital
                  Libraries},
  BOOKTITLE = {ECDL 2005},
  PAGES = {81--91},
  EDITOR = {Andreas Rauber and Stavros Christodoulakis and A. Min Tjoa},
  BOOKTITLE = {Research and Advanced Technology for Digital Libraries, 9th
                  European Conference, ECDL 2005, Vienna, Austria, September
                  18-23, 2005, Proceedings},
  PUBLISHER = {Springer},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {3652},
  YEAR = {2005},
  ISBN = {3-540-28767-1},
  PDF = {http://transducens.dlsi.ua.es/people/esv/pubs/ecdl05.pdf}
}

@INPROCEEDINGS{estal04:Sanchez+Forcada+Carrasco04,
  AUTHOR = {Enrique S{\'a}nchez Villamil and Mikel L. Forcada and Rafael
                  C. Carrasco},
  TITLE = {Unsupervised Training of a Finite-State Sliding-Window
                  Part-of-Speech Tagger.},
  YEAR = {2004},
  PAGES = {454--463},
  EE = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3230{\&}spage=454},
  EDITOR = {Jos{\'e} Luis Vicedo Gonz{\'a}lez and Patricio
                  Mart\'{\i}nez-Barco and Rafael Mu{\~n}oz and Maximiliano
                  Saiz-Noeda},
  BOOKTITLE = {Advances in Natural Language Processing, 4th International
                  Conference, EsTAL 2004, Alicante, Spain, October 20-22,
                  2004, Proceedings},
  PUBLISHER = {Springer},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {3230},
  ISBN = {3-540-23498-5},
  PDF = {http://www.dlsi.ua.es/~carrasco/papers/estal04.pdf}
}

@INPROCEEDINGS{ibpria03:Verdu+Calera+Carrasco,
  AUTHOR = {Jose L. Verd{\'u}-Mas and Jorge Calera-Rubio and Rafael
                  C. Carrasco},
  TITLE = {Smoothing Techniques for Tree-k-Grammar-Based Natural
                  Language Modeling.},
  YEAR = {2003},
  PAGES = {1057--1065},
  EE = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2652{\&}spage=1057},
  EDITOR = {Francisco J. Perales L{\'o}pez and Aur{\'e}lio C. Campilho
                  and Nicolas P{\'e}rez de la Blanca and Alberto Sanfeliu},
  BOOKTITLE = {Pattern Recognition and Image Analysis, First Iberian
                  Conference, IbPRIA 2003, Puerto de Andratx, Mallorca, Spain,
                  June 4-6, 2003, Proceedings},
  PUBLISHER = {Springer},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {2652},
  ISBN = {3-540-40217-9},
  PDF = {http://www.dlsi.ua.es/~carrasco/papers/ibpria03.pdf}
}

@INPROCEEDINGS{ciarp03:Verdu+Calera+Carrasco,
  AUTHOR = {Jose L. Verd{\'u}-Mas and Jorge Calera-Rubio and Rafael
                  C. Carrasco},
  TITLE = {Learning probabilistic context-free grammars from
                  treebanks.},
  YEAR = {2003},
  PAGES = {537--544},
  EE = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2905{\&}spage=537},
  EDITOR = {Alberto Sanfeliu and Jos{\'e} Ruiz-Shulcloper},
  BOOKTITLE = {Progress in Pattern Recognition, Speech and Image Analysis,
                  8th Iberoamerican Congress on Pattern Recognition, CIARP
                  2003, Havana, Cuba, November 26-29, 2003, Proceedings},
  BOOKTITLE = {CIARP},
  PUBLISHER = {Springer},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {2905},
  ISBN = {3-540-20590-X}
}

@INPROCEEDINGS{jbidi03:Sanchez+Inesta+Carrasco+Muhlberger,
  AUTHOR = {Enrique S{\'a}nchez Villamil and Jos{\'e} Manuel I{\~n}esta
                  Quereda and Rafael C. Carrasco and G{\"u}nter
                  M{\"u}hlberger},
  TITLE = {El proyecto {METAe} (Meta-data Engine Project): concepto,
                  implementaci{\'o}n e integraci{\'o}n en bibliotecas
                  digitales.},
  YEAR = {2003},
  PAGES = {177--186},
  EDITOR = {Eduardo Mena and Jes{\'u}s Tramullas},
  BOOKTITLE = {IV Jornadas de Bibliotecas Digitales, JBIDI 2003, Alicante,
                  Spain},
  ISBN = {84-688-3838-1}
}

@INPROCEEDINGS{jbidi03:Sanchez+carrasco,
  AUTHOR = {Enrique S{\'a}nchez Villamil and Rafael C. Carrasco},
  TITLE = {Buscadores de Contenidos para Bibliotecas Digitales:
                  Desarrollo de una Arquitectura para un Buscador {XML}.},
  YEAR = {2003},
  PAGES = {59--68},
  EDITOR = {Eduardo Mena and Jes{\'u}s Tramullas},
  BOOKTITLE = {IV Jornadas de Bibliotecas Digitales, JBIDI 2003, Alicante,
                  Spain},
  ISBN = {84-688-3838-1}
}

@INPROCEEDINGS{jbidi03:OrtizRojas+Carrasco,
  AUTHOR = {Sergio Ortiz-Rojas and Rafael C. Carrasco},
  TITLE = {Presentaci{\'o}n sin{\'o}ptica de textos biling{\"u}es
                  mediante distancias de edici{\'o}n.},
  YEAR = {2003},
  PAGES = {29--37},
  EDITOR = {Eduardo Mena and Jes{\'u}s Tramullas},
  BOOKTITLE = {IV Jornadas de Bibliotecas Digitales, JBIDI 2003, Alicante,
                  Spain},
  ISBN = {84-688-3838-1}
}

@INPROCEEDINGS{tmi02:Garrido+Forcada+Carrasco,
  BOOKTITLE = {Proceedings of TMI 2002 (Theoretical and
                  Methodological Issues in Machine Translation,
                  Keihanna/Kyoto, Japan, March 2002},
  PAGES = {53--62},
  TITLE = {Incremental construction and maintenance of
                  morphological analysers based on augmented letter
                  transducers},
  AUTHOR = {Alicia Garrido-Alenda and Mikel L. Forcada and
                  Rafael C. Carrasco},
  YEAR = {2002}
}

@INPROCEEDINGS{sspr02:Verdu+Forcada+Carrasco+Calera,
  AUTHOR = {Jose Luis Verdú-Mas and Mikel L. Forcada and Rafael
                  C. Carrasco and Jorge Calera-Rubio},
  TITLE = {Tree $k$-grammar models for natural language modelling and
                  parsing},
  EDITOR = {Terry Caelli and Adnan Amin and Robert P. W. Duin and Mohamed
                  S. Kamel and Dick de Ridder},
  BOOKTITLE = {Structural, Syntactic, and Statistical Pattern Recognition,
                  Joint IAPR International Workshops SSPR 2002 and SPR 2002,
                  Windsor, Ontario, Canada, Proceedings},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {2396},
  PAGES = {53--63},
  PUBLISHER = {Springer},
  YEAR = {2002},
  ISBN = {3-540-44011-9},
  PDF = {http://www.dlsi.ua.es/~carrasco/papers/sspr02.pdf}
}

@INPROCEEDINGS{icgi02:Rico+Calera+Carrasco,
  AUTHOR = {Juan Ramón Rico-Juan and Jorge Calera-Rubio and Rafael
                  C. Carrasco},
  TITLE = {Stochastic $k$-testable tree languages and applications},
  EDITOR = {Pieter W. Adriaans, Henning Fernau, Menno van Zaanen},
  BOOKTITLE = {Grammatical Inference: Algorithms and Applications, 6th
                  International Colloquium: ICGI 2002},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {2484},
  PAGES = {199--212},
  YEAR = {2002},
  ISBN = {3-540-44239-1}
}

@TECHREPORT{jdcl01:Carrasco+Bia+Forcada+Perez,
  AUTHOR = {Rafael C. Carrasco and Alejandro Bia and and Mikel
                  L. Forcada and Pedro M. P\'{e}rez-Ant\'{o}n},
  TITLE = {Turning {DTD}s into specialized tree-automata-based schemata
                  to match a collection of marked-up documents },
  INSTITUTION = {Universidad de Alicante},
  YEAR = {2002},
  POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/jcdl.ps.gz}
}

@INPROCEEDINGS{drn01,
  AUTHOR = {Mikel L.Forcada and Rafael C. Carrasco},
  EDITOR = {John F. Kolen and Stefan C. Kremer},
  BOOKTITLE = {A field guide to dynamical recurrent network},
  TITLE = {Simple stable encodings of finite-state machines in
                  dynamic recurrent networks},
  PUBLISHER = {IEEE Press},
  YEAR = 2001,
  ISBN = {0-7803-5369-2}
}

@INPROCEEDINGS{emernet1999:forcada+carrasco,
  AUTHOR = {Mikel Forcada and Rafael Carrasco},
  TITLE = {Finite-State Computation in Analog Neural Networks:
                  Steps Towards Biologically Plausible Models?},
  BOOKTITLE = {Emergent Neural Computational Architectures based on
                  Neuroscience},
  PAGES = {487--501},
  YEAR = 2001,
  EDITOR = {Stefan Wermter, Jim Austin, David Willshaw},
  VOLUME = 2036,
  SERIES = {Lecture Notes in Computer Science},
  MONTH = {March},
  PUBLISHER = {Springer},
  ISBN = {3-540-42363-X}
}

@INPROCEEDINGS{Bia-Carrasco:2001,
  AUTHOR = {Alejandro Bia and Rafael C. Carrasco},
  TITLE = {Automatic {DTD} simplification by examples},
  BOOKTITLE = {ACH/ALLC 2001. The Association for Computers and the
                  Humanities, The Association for Literary and
                  Linguistic Computing, The 2001 Joint International
                  Conference},
  YEAR = {2001},
  MONTH = {June},
  PAGES = {7--9},
  ADDRESS = {New York University, New York City}
}

@INPROCEEDINGS{snrfai01:Bia+Carrasco+Forcada,
  AUTHOR = {Alejandro Bia and Rafael C. Carrasco and Mikel
                  L. Forcada},
  TITLE = {Identifying a reduced {DTD} from marked up documents},
  BOOKTITLE = {Proc. of the IX Spanish Symposium on Pattern
                  Recognition and Image Analysis (SNRFAI-20001)},
  YEAR = {2001},
  PAGES = {385--390},
  POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/dtd.ps.gz}
}

@INPROCEEDINGS{snrfai01:Perea+Inesta+Calera+Carrasco,
  AUTHOR = {M. P\'{e}rez-Francisco and J.M. Iñesta and J. Calera
                  and R.C. Carrasco},
  TITLE = {Genetic algorithms for surface simplification},
  BOOKTITLE = {Proc. of the IX Spanish Symposium on Pattern
                  Recognition and Image Analysis (SNRFAI-20001)},
  YEAR = {2001},
  PAGES = {355-360},
  POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/snrfai01.ps.gz}
}

@INPROCEEDINGS{sspr2000:Forcada+Carrasco,
  AUTHOR = {Mikel L. Forcada and Rafael C. Carrasco},
  TITLE = {Encoding Nondeterministic Finite-State Tree Automata
                  in Sigmoid Recursive Neural Networks},
  EDITOR = {Ferri, F.J. and Iñesta, J.M. and Amin, A. and Pudil,
                  P.},
  BOOKTITLE = {Advances in Pattern Recognition, Proceedings Joint
                  IAPR International Workshops SSPR 2000 and SPR 2000,
                  (Alicante, Spain)},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {1876},
  PAGES = {203--210},
  ADDRESS = {Berlin},
  YEAR = {2000},
  PUBLISHER = {Springer},
  ISBN = {3-540-67946-4}
}

@INPROCEEDINGS{sspr2000:Rico+Calera+Carrasco,
  AUTHOR = { J.R. Rico-Juan and J. Calera-Rubio and
                  R.C. Carrasco},
  TITLE = {Lossless Compression of Surfaces Described as
                  Points},
  EDITOR = {Ferri, F.J. and Iñesta, J.M. and Amin, A. and Pudil,
                  P.},
  BOOKTITLE = {Advances in Pattern Recognition, Proceedings Joint
                  IAPR International Workshops SSPR 2000 and SPR 2000,
                  (Alicante, Spain)},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {1876},
  PAGES = {457--461},
  ADDRESS = {Berlin},
  YEAR = {2000},
  PUBLISHER = {Springer},
  ISBN = {3-540-67946-4}
}

@INPROCEEDINGS{conll2000:Verdu-Mas+Calera-Rubio+Carrasco,
  AUTHOR = {J.L. Verd\'{u}-Mas and J. Calera-Rubio and
                  R.C. Carrasco},
  TITLE = {A Comparison of PCFG Models},
  BOOKTITLE = {Proceedings of CoNLL-2000 and LLL-2000, Lisbon
                  (Portugal)},
  YEAR = {2000},
  PAGES = {123--125},
  MONTH = {September},
  EDITOR = {C. Cardie and W. Daelemans and C. N\'{e}dellec and
                  E. Tjong-Kim-Sang},
  ADDRESS = {New Brunswick, NJ (USA)},
  PUBLISHER = {Association for Computational Linguistics},
  POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/CONLL2000.ps.gz},
  ABSTRACT = { In this paper, we compare three different
                  approaches to build a probabilistic context-free
                  grammar for natural language parsing from a tree
                  bank corpus: 1) a model that simply extracts the
                  rules contained in the corpus and counts the number
                  of occurrences of each rule 2) a model that also
                  stores information about the parent node's category
                  and, 3) a model that estimates the probabilities
                  according to a generalized $k$-gram scheme with
                  $k=3$. The last one allows for a faster parsing and
                  decreases the perplexity of test samples.}
}

@INPROCEEDINGS{icgi2000:Rico-Juan+Calera-Rubio+Carrasco,
  AUTHOR = {J.R. Rico-Juan and J. Calera-Rubio and
                  R.C. Carrasco},
  TITLE = {Probabilistic $k$-Testable Tree-Languages},
  BOOKTITLE = {Proceedings of 5th International Colloquium, ICGI
                  2000, Lisbon (Portugal)},
  EDITOR = {A.L. Oliveira},
  VOLUME = {1891},
  SERIES = {Lecture Notes in Computer Science},
  PAGES = {221--228},
  ADDRESS = {Berlin},
  YEAR = {2000},
  PUBLISHER = {Springer},
  ISBN = {3-540-41011-2},
  POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/ICGI2000.ps.gz},
  ABSTRACT = {In this paper, we present a natural generalization
                  of $k$-gram models for tree stochastic languages
                  based on the $k$-testable class. In this class of
                  models, frequencies are estimated for a
                  probabilistic regular tree grammar wich is bottom-up
                  deterministic. One of the advantages of this
                  approach is that the model can be updated in an
                  incremental fashion. This method is an alternative
                  to costly learning algorithms (as
                  inside-outside-based methods) or algorithms that
                  require larger samples (as many state
                  merging/splitting methods)}
}

@INCOLLECTION{iosp2000:Calera-Rubio+Carrasco+Oncina,
  AUTHOR = {Jorge Calera-Rubio and Rafael C. Carrasco and Jose
                  Oncina},
  EDITOR = {M.I. Torres and A. Sanfeliu},
  BOOKTITLE = {Pattern Recognition and Applications. Frontiers in
                  Artificial Intelligence and Applications},
  TITLE = {Tree languages arithmetic compression},
  PUBLISHER = {IOS Press},
  YEAR = 2000,
  VOLUME = 56,
  PAGES = {51-58},
  ISBN = {1-58603-034-5}
}

@INPROCEEDINGS{esann1999:Neco+Forcada+Carrasco+Valdes-Munoz,
  AUTHOR = {Ram\'{o}n P. Ñeco and Mikel L. Forcada and
                  Rafael C. Carrasco and M.\'{A}ngeles
                  Vald\'{e}s-Muñoz},
  TITLE = {Encoding of sequential translators in discrete-time
                  recurrent neural networks},
  BOOKTITLE = {Proc. ESANN'99 (Bruges, Belgium, 21-24 April 1999)},
  PAGES = {375--380},
  YEAR = {1999},
  MONTH = APR # {21-24~},
  POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/ESANN99.ps.gz},
  ABSTRACT = { In recent years, there has been a lot of interest
                  in the use of discrete-time recurrent neural nets
                  (DTRNN) to learn finite-state tasks, and in the
                  computational power of DTRNN, particularly in
                  connection with finite-state computation. This paper
                  describes a simple strategy to devise stable
                  encodings of sequential finite-state translators
                  (SFST) in a second-order DTRNN with units having
                  bounded, strictly growing, continuous sigmoid
                  activation functions. The strategy relies on
                  bounding criteria based on a study of the conditions
                  under which the DTRNN is actually behaving as a
                  SFST.}
}

@INPROCEEDINGS{icann1999:Carasco+Oncina+Forcada,
  AUTHOR = {Rafael C. Carrasco and Jose Oncina and Mikel
                  L. Forcada},
  TITLE = { Efficient encodings of finite automata in
                  discrete-time recurrent neural networks},
  BOOKTITLE = {Proceedings of ICANN'99 (Edinburgh, Scotland,
                  September 1999)},
  VOLUME = 2,
  YEAR = {1999},
  PAGES = {673--677},
  ABSTRACT = {A number of researchers have used discrete-time
                  recurrent neural nets (DTRNN) to learn finite-state
                  machines (FSM) from samples of input and output
                  strings; trained DTRNN usually shows FSM behaviour
                  for strings up to a certaing length, but not beyond;
                  this is usually called instability. Other authors
                  have shown that DTRNN may actually behave as FSM for
                  strings of any length and have devised strategies to
                  construct such DTRNN. In these strategies, m-state
                  deterministic FSM are encoded and the number of
                  state units in the DTRNN is O(m). This paper shows
                  that more efficient sigmoid DTRNN encodings exist
                  for a subclass of deterministic finite automata
                  (DFA), namely, when the size of an equivalent
                  nondeterministic finite automata (NFA) is smaller,
                  because n-state NFA may directly be encoded in DTRNN
                  with a O(n) units.}
}

@INPROCEEDINGS{snaerfai1999:Calera-Rubio+Carrasco+Oncina,
  AUTHOR = {Jorge Calera-Rubio and Rafael C. Carrasco and Jose
                  Oncina},
  TITLE = {Tree languages arithmetic compression },
  BOOKTITLE = {Pattern Recognition and Image Analysis. Proceedings
                  of the VIII Simposium Nacional de Reconocimiento de
                  Formas y Análisis de Imágenes. Bilbao, 1999},
  PAGES = {405--411},
  YEAR = {1999},
  EDITOR = {M.I.Torres and A.Sanfeliu},
  VOLUME = {I},
  PUBLISHER = {Ediciones Geneve},
  POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/aerfai.ps.gz},
  ABSTRACT = {In this paper, we explore the applicability to
                  compression tasks of the algorithms for regular
                  language inference from stochastic samples. We
                  compare two arithmetic encoders based upon two
                  different kinds of formal languages: string
                  languages and tree languages. The experiments show
                  that tree-based methods outperform the predictive
                  capability of string-based methods when they are
                  applied to files containing structural information
                  and, then, they allow for better compression rates.}
}

@INPROCEEDINGS{icgi1998:Carrasco+Oncina+Calera-Rubio,
  AUTHOR = {Rafael C. Carrasco and Jose Oncina and Jorge Calera},
  TITLE = {Stochastic Inference of Regular Tree Languages},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {1433},
  PAGES = {187--198},
  YEAR = {1998},
  EDITOR = {V. Honavar and G. Slutzki},
  BOOKTITLE = {Proceedings of the Fourth International Colloquium
                  on Grammatical Inference (ICGI98)},
  CODEN = {LNCSD9},
  ISSN = {0302-9743},
  PUBLISHER = {Springer},
  ADDRESS = {Berlin},
  ISBN = {3-540-64776-7},
  POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/icgi98.ps.gz},
  ABSTRACT = {We generalize a former algorithm for regular
                  language identification from stochastic samples to
                  the case of tree languages or, equivalently, string
                  languages where structural information is
                  available. We also describe a method to compute
                  efficiently the relative entropy between the target
                  grammar and the inferred one, useful for the
                  evaluation of the inference.}
}

@INPROCEEDINGS{icgi1996:Carrasco+Forcada+Santamaria,
  AUTHOR = {Rafael C. Carrasco and M. L. Forcada and Laureano
                  Santamar\'{\i}a},
  TITLE = {Inferring stochastic regular grammars with recurrent
                  neural networks},
  PAGES = {274--281},
  ISBN = {3-540-61778-7},
  EDITOR = {Laurent Miclet and Colin de la Higuera},
  BOOKTITLE = {Proceedings of the Third International Colloquium on
                  Grammatical Inference (ICGI96): Learning Syntax from
                  Sentences},
  MONTH = SEP # {25--27~},
  SERIES = {Lecture Notes in Artificial Intelligence},
  VOLUME = {1147},
  PUBLISHER = {Springer},
  ADDRESS = {Berlin},
  YEAR = {1996},
  ISBN = {3-540-61778-7},
  POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/ICGI96.ps.gz},
  ABSTRACT = { Recent work has shown that the extraction of
                  symbolic rules improves the generalization
                  performance of recurrent neural networks trained
                  with complete (positive and negative) samples of
                  regular languages. This paper explores the
                  possibility of inferring the rules of the language
                  when the network is trained instead with stochastic,
                  positive-only data. For this purpose, a recurrent
                  network with two layers is used. If instead of using
                  the network itself, an automaton is extracted from
                  the network after training and the transition
                  probabilities of the extracted automaton are
                  estimated from the sample, the relative entropy with
                  respect to the true distribution is reduced.}
}

@INPROCEEDINGS{iwann1995:Carrasco+Forcada,
  AUTHOR = {Rafael C. Carrasco and M. L. Forcada},
  BOOKTITLE = {From Natural to Artificial Neural Computation:
                  Proceedings of IWANN'95},
  TITLE = {Second-order recurrent neural networks can learn
                  regular grammars from noisy strings},
  YEAR = {1995},
  POSTSCRIPT = {http://www.dlsi.ua.es/~carrasco/papers/iwann95.ps.gz},
  EDITOR = {J. Mira and F. Sandoval},
  KEYWORDS = {noisy strings, pattern recognition, recurrent neural
                  networks, second-order},
  PAGES = {605--610},
  PUBLISHER = {Springer Verlag},
  SERIES = {Lecture Notes in Computer Science},
  VOLUME = {930},
  ISBN = {3-540-59497-3},
  SCOPE = {appl},
  ABSTRACT = {Recent work has shown that second-order recurrent
                  neural networks (2ORNNs) may be used to infer
                  deterministic finite automata (DFA) when trained
                  with positive and negative string examples. This
                  paper shows that 2ORNN can also learn DFA from
                  samples consisting of pairs (W, nw) where W is a
                  noisy string of inputs vectors describing the degree
                  of resemblance of every input to the symbols in the
                  alphabet, and nw is the degree of acceptance of the
                  noisy string, computed with a DFA whose behavior has
                  been extended to deal with noisy strings.}
}

@INPROCEEDINGS{icgi1994:Carrasco+Oncina,
  AUTHOR = {Rafael C. Carrasco and Jose Oncina},
  TITLE = {Learning Stochastic Regular Grammars by Means of a
                  State Merging Method},
  PAGES = {139--152},
  ISBN = {3-540-58473-0},
  EDITOR = {Rafael C. Carrasco and Jose Oncina},
  BOOKTITLE = {Proceedings of the Second International Colloqium on
                  Grammatical Inference and Applications (ICGI94)},
  MONTH = {September},
  SERIES = {Lecture Notes in Artificial Intelligence},
  VOLUME = {862},
  PUBLISHER = {Springer Verlag},
  ADDRESS = {Berlin},
  YEAR = {1994},
  ISBN = {3-540-58473-0},
  ABSTRACT = {We propose a new algorithm which allows for the
                  identification of any stochastic deterministic
                  regular language as well as the determination of the
                  probabilities of the strings in the language. Tha
                  algorithm builds the prefix tree acceptor from the
                  sample set and merges systematically equivalent
                  states. Experimentally, it proves very fast and the
                  time needed grows only linearly with the size of the
                  sample set.}
}

@INPROCEEDINGS{Osaka96,
  AUTHOR = {E. Oset and F. Cano and J.A. Gomez-Tejedor and
                  S. Kamalov and M.J. Vicente-Vacas and R.C. Carrasco
                  and A. Ramos and L.L. Salcedo and H. Toki},
  TITLE = {One and Two Pion Photoproduction and Related Photon
                  Absorption Processes},
  BOOKTITLE = {Frontier 96: Nuclear Physics Frontiers with
                  Electro-Weak Probes (Osaka, Japan)},
  YEAR = {1996},
  ISBN = {981-02-2916-X}
}

@INPROCEEDINGS{Gent95,
  AUTHOR = {E. Oset and R.C. Carrasco and J.A. Gomez-Tejedor and
                  A. Ramos and L.L. Salcedo and M.J. Vicente-Vacas},
  TITLE = {Photonuclear reactions leading to $NN$,
                  $N\pi$,$\pi\pi$ emission},
  BOOKTITLE = {2nd International Workshop on Electromagnetically
                  Induced Two-nucleon Emission. Gent, Belgium, 17-20
                  May 1995},
  YEAR = {1995}
}

@INPROCEEDINGS{Vicente,
  AUTHOR = {M.J. Vicente-Vacas and R.C. Carrasco and E. Oset},
  TITLE = {Inclusive ($\gamma$,N), ($\gamma$,NN) and
                  ($\gamma$,N$\pi$) Reactions in Nuclei},
  BOOKTITLE = {Particles and Nuclei. Proceedings of the XIII
                  International Conference (Perugia, Italy, 28 June--2
                  July 1993)},
  VOLUME = {1},
  EDITOR = {A. Pascolini},
  PUBLISHER = {World Scientific},
  YEAR = {1994},
  ISBN = {9810217994}
}

@INPROCEEDINGS{WEIN92,
  AUTHOR = {R. C. Carrasco and M. J. Vicente and E. Oset},
  TITLE = {Inclusive (gamma,N), (gamma,N N) ... reactions in
                  nuclei at intermediate energies},
  BOOKTITLE = {Weak and Electromagnetic Interactions in Nuclei:
                  Proceedings of 3rd International Symposium},
  YEAR = {1992},
  PUBLISHER = {World Scientific},
  PAGES = {826-832},
  EDITOR = {Ts. D. Vylov},
  ISBN = {9810212119}
}

@INPROCEEDINGS{PIONS92,
  AUTHOR = {R.C. Carrasco and E. Oset},
  TITLE = {Photon Absorption and Inclusive ($\gamma$,$\pi$)},
  BOOKTITLE = {Pions in Nuclei},
  EDITOR = {E. Oset, M.J. Vicente-Vacas and C. Garcia-Recio},
  PAGES = {544-554},
  PUBLISHER = {World Scientific},
  YEAR = {1992},
  ISBN = {9810207328}
}

@INPROCEEDINGS{Oset1991,
  AUTHOR = {E. Oset and R. C. Carrasco and L. L. Salcedo},
  TITLE = {Photon and pion nuclear absorption mechanisms},
  BOOKTITLE = {Mesons and Light Nuclei},
  EDITOR = {E. Truhlik and R. Mach},
  SERIES = {Few Body Syst. Suppl.},
  VOLUME = {5},
  YEAR = {1992},
  PAGES = {159-164},
  PUBLISHER = {Springer Verlag}
}

@INPROCEEDINGS{GOT1990a,
  AUTHOR = {R. C. Carrasco and E. Oset and L. L. Salcedo},
  TITLE = {Photonuclear reactions at intermediate energies},
  BOOKTITLE = {Perspectives on Photon Interactions with Hadrons and
                  Nuclei},
  NOTE = {Workshop on Vector Dominance Phenomena in the
                  Interaction of Photons with Hadrons and Nuclei,
                  Gottingen, Germany, Feb 1990},
  EDITOR = {M. Schumacher and G. Tamas},
  PAGES = { 207-224},
  ISBN = {3-540-52981-0},
  SERIES = {Lecture Notes in Physics},
  NUMBER = {365},
  PUBLISHER = {Springer-Verlag },
  YEAR = {1990}
}

@INPROCEEDINGS{GOT1990b,
  AUTHOR = {R. C. Carrasco and E. Oset and W. Weise},
  TITLE = {Dipole sum rule enhancement in nuclei},
  BOOKTITLE = {Perspectives on Photon Interactions with Hadrons and
                  Nuclei},
  NOTE = {Workshop on Vector Dominance Phenomena in the
                  Interaction of Photons with Hadrons and Nuclei,
                  Gottingen, West Germany, Feb 1990},
  EDITOR = {M. Schumacher and G. Tamas},
  PAGES = { 246-251},
  SERIES = {Lecture Notes in Physics},
  NUMBER = { 365},
  PUBLISHER = {Springer-Verlag },
  YEAR = {1990},
  ISBN = {3-540-52981-0}
}

@INPROCEEDINGS{Elba1989,
  AUTHOR = {R. C. Carrasco and E. Oset},
  TITLE = {Two nucleon and three nucleon mechanisms in nuclear
                  photon absorption},
  BOOKTITLE = {International Workshop on Two Nucleon Emission
                  Reactions, Elba (Italy)},
  YEAR = {1989},
  EDITOR = {S. Boffi}
}

@INPROCEEDINGS{CEBAF1989,
  AUTHOR = {R. C. Carrasco},
  TITLE = {Many body approach to electron scattering},
  BOOKTITLE = {HUGS at CEBAF Proceedings},
  YEAR = {1989},
  PAGES = {197-204},
  PUBLISHER = { Hampton University}
}