scientific article

From MaRDI portal

Revision as of 14:30, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2762501

Jump to:navigation, search

zbMath0976.68089MaRDI QIDQ2762501

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

Publication date: 9 January 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2010/20100144

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

Inferring regular languages and \(\omega\)-languages ⋮ Learning regular languages using RFSAs. ⋮ Nondeterministic syntactic complexity ⋮ Identification of birfsa languages. ⋮ Minimal NFA and biRFSA Languages ⋮ Generalization of the Double-Reversal Method of Finding a Canonical Residual Finite State Automaton ⋮ Learning residual alternating automata

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2762501&oldid=15638005"