Inference of \(\omega\)-languages from prefixes.
type: Item
instance of: scholarly article
title: Inference of \(\omega\)-languages from prefixes.
zbMATH Open document ID: 1069.68071
author: Colin de la Higuera
author: Jean-Christophe Janodet
published in: Theoretical Computer Science
publication date: 2004-03-14T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q32
zbMATH DE Number: 2056571
zbMATH Keywords: Infinite string languages
zbMATH Keywords: Grammatical inference
zbMATH Keywords: Identification in the limit
zbMATH Keywords: Polynomial identification from given data
MaRDI profile type: Publication
full work available at URL: j.tcs.2003.11.009
OpenAlex ID: W2010088996
cites work: Defining liveness
cites work: On the complexity of minimum inference of regular sets
cites work: Q4036555
cites work: Q5525343
cites work: Characteristic sets for polynomial grammatical inference
cites work: Language identification in the limit
cites work: Complexity of automaton identification from given data
cites work: Q4440395
cites work: Proving the Correctness of Multiprocess Programs
cites work: On the learnability of infinitary regular sets
cites work: Q2754016
cites work: Q4385530
cites work: Q4440406
cites work: Automata-theoretic techniques for modal logics of programs
DOI: 10.1016/J.TCS.2003.11.009
description: scientific article; zbMATH DE number 2056571