Learning regular languages using RFSAs.
type: Item
instance of: scholarly article
title: Learning regular languages using RFSAs.
zbMATH Open document ID: 1059.68058
author: François Denis
author: Aurélien Lemay
author: Alain Terlutte
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 2056570
zbMATH Keywords: Grammatical inference
zbMATH Keywords: Machine learning
zbMATH Keywords: Regular languages
zbMATH Keywords: Finite state automata
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.11.008
OpenAlex ID: W2095745830
cites work: Learning regular sets from queries and counterexamples
cites work: Derivatives of Regular Expressions
cites work: Q2753999
cites work: Q2754000
cites work: Q2762501
cites work: Q4799353
cites work: Q4440387
cites work: Complexity of automaton identification from given data
cites work: Characteristic sets for polynomial grammatical inference
cites work: Q5592246
cites work: Q4714446
DOI: 10.1016/J.TCS.2003.11.008
description: scientific article; zbMATH DE number 2056570