Amanote Research

Amanote Research

    RegisterSign In

Learning Finite Automata Using Label Queries

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-04414-4_17
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2009

Authors
Dana AngluinLeonor Becerra-BonacheAdrian Horia DediuLev Reyzin
Publisher

Springer Berlin Heidelberg


Related search

Learning Stochastic Finite Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Distributed Computation of Web Queries Using Automata

2002English

String Taxonomy Using Learning Automata

IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
1997English

Deterministic Finite Automata

Algebra and Discrete Mathematics
2012English

Object Partitioning by Using Learning Automata.

English

Finite Time Analysis of the Pursuit Algorithm for Learning Automata

IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
1996English

Implementation of Finite State Automata Using fLIF Neurons

2008English

Learning Languages From Positive Data and a Finite Number of Queries

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2006English

Faster Generation of Super Condensed Neighbourhoods Using Finite Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy