Grammatical inference: algorithms and applications. 7th international colloquium, ICGI 2004, Athens, Greece, October 11--13, 2004. Proceedings.
The articles of this volume will be reviewed individually. The preceding colloquium has been reviewed (see Zbl 1001.00047) . Indexed articles: \textit{Angluin, Dana}, Learning and mathematics, 1-2 [Zbl 1111.97300] \textit{Vidal, Enrique; Casacuberta, Francisco}, Learning finite-state models for machine translation, 3-15 [Zbl 1111.68720] \textit{Starkie, Bradford; Coste, François; van Zaanen, Menno}, The Omphalos context-free grammar learning competition, 16-27 [Zbl 1111.68480] \textit{Abela, John; Coste, François; Spina, Sandro}, Mutually compatible and incompatible merges for the search of the smallest consistent DFA, 28-39 [Zbl 1111.68487] \textit{Bagos, Pantelis G.; Liakopoulos, Theodore D.; Hamodrakas, Stavros J.}, Faster gradient descent training of hidden Markov models, using individual learning rate adaptation, 40-52 [Zbl 1111.68609] \textit{Becerra-Bonache, Leonor; Yokomori, Takashi}, Learning mild context-sensitiveness: Toward understanding children's language learning, 53-64 [Zbl 1111.68459] \textit{Béchet, Denis; Foret, Annie; Tellier, Isabelle}, Learnability of pregroup grammars, 65-76 [Zbl 1111.68460] \textit{Callut, Jérôme; Dupont, Pierre}, A Markovian approach to the induction of regular string distributions, 77-90 [Zbl 1111.68463] \textit{Carme, Julien; Lemay, Aurélien; Niehren, Joachim}, Learning node selecting tree transducer from completely annotated examples, 91-102 [Zbl 1111.68465] \textit{Case, John; Jain, Sanjay; Martin, Eric; Sharma, Arun; Stephan, Frank}, Identifying clusters from positive data, 103-114 [Zbl 1111.68466] \textit{Coste, François; Fredouille, Daniel; Kermorvant, Christopher; de la Higuera, Colin}, Introducing domain and typing bias in automata inference, 115-126 [Zbl 1111.68467] \textit{Delhay, Arnaud; Miclet, Laurent}, Analogical equations in sequences: Definition and resolution, 127-138 [Zbl 1111.68468] \textit{Eyraud, Rémi; de la Higuera, Colin; Janodet, Jean-Christophe}, Representing languages by learnable rewriting systems, 139-150 [Zbl 1111.68469] \textit{Gamallo, Pablo; Lopes, Gabriel P.; Da Silva, Joaquim F.}, A divide-and-conquer approach to acquire syntactic categories, 151-162 [Zbl 1111.68471] \textit{Geertzen, Jeroen; van Zaanen, Menno}, Grammatical inference using suffix trees, 163-174 [Zbl 1111.68472] \textit{de la Higuera, Colin; Oncina, Jose}, Learning stochastic finite automata, 175-186 [Zbl 1111.68485] \textit{Karampatziakis, Nikolaos; Paliouras, Georgios; Pierrakos, Dimitrios; Stamatopoulos, Panagiotis}, Navigation pattern discovery using grammatical inference, 187-198 [Zbl 1111.68473] \textit{Krieger, Hans-Ulrich}, A corpus-driven context-free approximation of head-driven phrase structure grammar, 199-210 [Zbl 1111.68474] \textit{Moreau, Erwan}, Partial learning using link grammars data, 211-222 [Zbl 1111.68476] \textit{Petasis, Georgios; Paliouras, Georgios; Spyropoulos, Constantine D.; Halatsis, Constantine}, eg-GRIDS: Context-free grammatical inference from positive examples using genetic search, 223-234 [Zbl 1111.68478] \textit{Starkie, Bradford; Fernau, Henning}, The Boisdale algorithm -- an induction method for a subclass of unification grammar from positive data, 235-247 [Zbl 1111.68481] \textit{Thollard, Franck; Clark, Alexander}, Learning stochastic deterministic regular languages, 248-259 [Zbl 1111.68483] \textit{Wakatsuki, Mitsuo; Teraguchi, Kiyoshi; Tomita, Etsuji}, Polynomial time identification of strict deterministic restricted one-counter automata in some class from positive data, 260-272 [Zbl 1111.68484] \textit{Brooks, David; Lee, Mark}, Learning syntax from function words, 273-274 [Zbl 1111.68461] \textit{Cano, Antonio; Ruiz, José; García, Pedro}, Running FCRPNI in efficient time for piecewise and right piecewise testable languages, 275-276 [Zbl 1111.68464] \textit{Fernau, Henning}, Extracting minimum length document type definitions is NP-hard, 277-278 [Zbl 1111.68470] \textit{Laxminarayana, J. A.; Sempere, José M.; Nagaraja, G.}, Learning distinguishable linear grammars from positive data, 279-280 [Zbl 1111.68475] \textit{Nakamura, Katsuhiko}, Extending incremental learning of context free grammars in synapse, 281-282 [Zbl 1111.68477] \textit{Calera-Rubio, Jorge; Oncina, Jose}, Identifying left-right deterministic linear languages, 283-284 [Zbl 1111.68462] \textit{Seki, Shinnosuke; Kobayashi, Satoshi}, Efficient learning of \(k\)-reversible context-free grammars from positive structural examples, 285-287 [Zbl 1111.68479] \textit{Tajima, Yasuhiro; Kotani, Yoshiyuki; Terada, Matsuaki}, An analysis of examples and a search space for PAC learning of simple deterministic languages with membership queries, 288-289 [Zbl 1111.68482]
scientific article; zbMATH DE number 2171869