How to Split Recursive Automata

Isabelle Tellier 1, 2, *
* Corresponding author
2 MOSTRARE - Modeling Tree Structures, Machine Learning, and Information Extraction
LIFL - Laboratoire d'Informatique Fondamentale de Lille, Inria Lille - Nord Europe
Abstract : In this paper, we interpret in terms of operations applying on extended finite state automata some algorithms that have been specified on categorial grammars to learn subclasses of context-free languages. The algorithms considered implement "specialization strategies". This new perspective also helps to understand how it is possible to control the combinatorial explosion that specialization techniques have to face, thanks to a typing approach.
Complete list of metadatas

https://hal.inria.fr/inria-00341770
Contributor : Isabelle Tellier <>
Submitted on : Tuesday, November 25, 2008 - 10:46:47 PM
Last modification on : Tuesday, May 21, 2019 - 3:38:12 PM
Long-term archiving on : Monday, June 7, 2010 - 11:23:24 PM

File

icgi08-tellier.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00341770, version 1

Collections

Citation

Isabelle Tellier. How to Split Recursive Automata. 9th International Colloquium ICGI, Alexander Clark, François Coste, Laurent Miclet, 2008, St Malo, France. pp.200-212. ⟨inria-00341770⟩

Share

Metrics

Record views

259

Files downloads

442