scientific article
From MaRDI portal
Publication:3404129
zbMath1227.68112MaRDI QIDQ3404129
Publication date: 5 February 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational learning theory (68Q32) Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Machine vision and scene understanding (68T45)
Related Items (42)
Learning of Structurally Unambiguous Probabilistic Grammars ⋮ Improving Symbolic Automata Learning with Concolic Execution ⋮ Use of a novel grammatical inference approach in classification of amyloidogenic hexapeptides ⋮ First-Order Logic Definability of Free Languages ⋮ Learning from positive and negative examples: dichotomies and parameterized algorithms ⋮ Four one-shot learners for regular tree languages and their polynomial characterizability ⋮ Active model learning of stochastic reactive systems ⋮ Learning from positive and negative examples: new proof for binary alphabets ⋮ Learning reward machines: a study in partially observable reinforcement learning ⋮ Learning deterministic probabilistic automata from a model checking perspective ⋮ Inductive synthesis of cover-grammars with the help of ant colony optimization ⋮ Learning quantum finite automata with queries ⋮ A survey of model learning techniques for recurrent neural networks ⋮ Unnamed Item ⋮ On the Inference of Finite State Automata from Positive and Negative Data ⋮ Learning Tree Languages ⋮ Categorial Dependency Grammars with Iterated Sequences ⋮ A provably stable neural network Turing machine with finite precision and time ⋮ Polynomial characteristic sets for \(DFA\) identification ⋮ Unnamed Item ⋮ Shapley Homology: Topological Analysis of Sample Influence for Neural Networks ⋮ Regular inference as vertex coloring ⋮ Learning register automata: from languages to program structures ⋮ Adaptively learning probabilistic deterministic automata from data streams ⋮ \textsc{PAutomaC}: a probabilistic automata and hidden Markov models learning competition ⋮ Improving active Mealy machine learning for protocol conformance testing ⋮ \(L^\ast\)-based learning of Markov decision processes (extended version) ⋮ Grammatical inference of directed acyclic graph languages with polynomial time complexity ⋮ Auction optimization using regression trees and linear models as integer programs ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ Probabilistic black-box reachability checking (extended version) ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Learning grammars for architecture-specific facade parsing ⋮ Inference of bounded L systems with polymorphic P systems ⋮ Enhancing Automata Learning by Log-Based Metrics ⋮ Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference ⋮ Learning algorithms ⋮ Diameter and stationary distribution of random \(r\)-out digraphs ⋮ Induction and Exploitation of Subgoal Automata for Reinforcement Learning ⋮ A categorical framework for learning generalised tree automata ⋮ Learning residual alternating automata ⋮ Inferring local transition functions of discrete dynamical systems from observations of system behavior
Uses Software
This page was built for publication:
