Work

Some Classes of Regular Languages Identifiable in the Limit from Positive Data

Year: 2002

Type: conference-paper

Source: Lecture notes in computer science

DOI: 10.1007/3-540-45790-9_6

Authors: François Denis, Aurélien Lemay, Alain Terlutte

Institutions: Centre National de la Recherche Scientifique, Laboratoire d’Informatique Fondamentale de Marseille, Université de Provence Aix-Marseille I, Université de Lille, Charles de Gaulle Université de Lille III

Language: English

Topic: semigroups and automata theory

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W1597434097

FWCI: 1.478

Cites: 17

Cited by: 14

Related to: 10