Amanote Research

Amanote Research

    RegisterSign In

Learning Regular Languages From Positive Evidence

doi 10.21236/ada459428
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 1998

Authors
Laura FiroiuTim OatesPaul R. Cohen
Publisher

Defense Technical Information Center


Related search

Learning Regular Languages Over Large Alphabets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Learning Languages From Positive Data and a Finite Number of Queries

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

Regular Languages in NC1

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1992English

On Learning Languages From Positive Data and a Limited Number of Short Counterexamples

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Union-Freeness of Regular Languages

International Journal of Computer Applications
2012English

Regular Languages Meet Prefix Sorting

2020English

Renormalized Measure of Regular Languages

International Journal of Control
ControlSystems EngineeringComputer Science Applications
2006English

Automata in Categories and Regular Languages

Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics
1984English

Enumerating the Strings of Regular Languages

Journal of Functional Programming
Software
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy