scientific article; zbMATH DE number 2019612

MaRDI QIDQ4440406zbMATH OpenFDO

Authors M. Humrosia Begam, K. G. Subramanian, S. Gnanasekaran, Durairaj Gnanaraj Thomas

Publication date 17 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2484/24840283.htm

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning of Regular ω-Tree Languages
• Learning regular omega languages
• Learning regular omega languages
• On the learnability of infinitary regular sets
• Inference of -languages from prefixes.

Cited in

(8)

• Langages algébriques de mots biinfinis. (Algebraic languages of biinfinite words)
• Finitely generated bi\(\omega\)-languages
• Inference of -languages from prefixes.
• On the regularity and learnability of ordered DAG languages
• Learning regular omega languages
• Learning of Regular ω-Tree Languages
• scientific article; zbMATH DE number 2080669 (Why is no real title available?)
• Combinatorial Image Analysis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4440406)