Grammatical inference: algorithms and applications. 5th international colloquium, ICGI 2000, Lisbon, Portugal, September 11--13, 2000. Proceedings
The articles of mathematical interest will be reviewed individually. The 2nd colloquium 1994 has been reviewed (see Zbl 0802.00036). Indexed articles: \textit{Casacuberta, Francisco}, Inference of finite-state transducers by using regular grammars and morphisms, 1-14 [Zbl 0974.68529] \textit{Casacuberta, Francisco; de la Higuera, Colin}, Computational complexity of problems on probabilistic grammars and transducers, 15-24 [Zbl 0974.68511] \textit{Coste, François; Fredouille, Daniel}, Efficient ambiguity detection in \(C\)-NFA. A step towards the inference of non deterministic automata, 25-38 [Zbl 0974.68516] \textit{Denis, François; Lemay, Aurélien; Terlutte, Alain}, Learning regular languages using non deterministic finite automata, 39-50 [Zbl 0974.68088] \textit{Dupont, Pierre; Amengual, Juan-Carlos}, Smoothing probabilistic automata: An error-correcting approach, 51-64 [Zbl 0974.68515] \textit{Emerald, J. D.; Subramanian, K. G.; Thomas, D. G.}, Inferring subclasses of contextual languages, 65-74 [Zbl 0974.68087] \textit{Fernau, Henning; Sempere, José M.}, Permutations and control sets for learning non-regular language families, 75-88 [Zbl 0974.68089] \textit{Florêncio, Christophe Costa}, On the complexity of consistent identification of some classes of structure languages, 89-102 [Zbl 0974.68092] \textit{Fred, Ana L. N.}, Computation of substring probabilities in stochastic grammars, 103-114 [Zbl 0974.68074] \textit{García, P.; Cano, A.; Ruiz, J.}, A comparative study of two algorithms for automata identification, 115-126 [Zbl 0974.68513] \textit{Guimarães, G.}, The induction of temporal grammatical rules from multivariate time series, 127-140 [Zbl 0974.68563] \textit{de la Higuera, Colin; Thollard, Franck}, Identification in the limit with probability one of stochastic deterministic finite automata, 141-156 [Zbl 0974.68091] \textit{Kobayashi, Satoshi}, Iterated transductions and efficient learning from positive data: A unifying view, 157-170 [Zbl 0974.68167] \textit{Martinek, Pavel}, An inverse limit of context-free grammars -- a new approach to identifiability in the limit, 171-185 [Zbl 0974.68075] \textit{Nakamura, Katsuhiko; Ishiwata, Takashi}, Synthesizing context free grammars from sample strings based on inductive CYK algorithm, 186-195 [Zbl 0974.68512] \textit{Nevado, Francisco; Sánchez, Joan-Andreu; Benedi, José-Miguel}, Combination of estimation algorithms and grammatical inference techniques to learn stochastic context-free grammars, 196-206 [Zbl 0974.68532] \textit{Parekh, Rajesh; Honavar, Vasant}, On the relationship between models for learning in helpful environments, 207-220 [Zbl 0974.68165] \textit{Rico-Juan, Juan Ramón; Calera-Rubio, Jorge; Carrasco, Rafael C.}, Probabilistic \(k\)-testable tree languages, 221-228 [Zbl 0974.68514] \textit{Sakakibara, Yasubumi; Muramatsu, Hidenori}, Learning context-free grammars from partially structured examples, 229-240 [Zbl 0974.68530] \textit{Sakamoto, Hiroshi; Arimura, Hiroki; Arikawa, Setsuo}, Identification of tree translation rules from examples, 241-255 [Zbl 0974.68164] \textit{Stephan, Frank; Terwijn, Sebastiaan A.}, Counting extensional differences in BC-learning, 256-269 [Zbl 0974.68163] \textit{Sugimoto, Noriko; Toyoshima, Takashi; Shimozono, Shinichi; Hirata, Kouichi}, Constructive learning of context-free languages with a subpansive tree, 270-283 [Zbl 0974.68162] \textit{Tajima, Yasuhiro; Tomita, Etsuji}, A polynomial time learning algorithm of simple deterministic languages via membership queries and a representative sample, 284-297 [Zbl 0974.68166] \textit{Vilar, Juan Miguel}, Improve the learning of subsequential transducers by using alignments and dictionaries, 298-311 [Zbl 0974.68531]
scientific article; zbMATH DE number 1519426