scientific article

From MaRDI portal

Revision as of 23:36, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:3517256

Jump to:navigation, search

DOI10.25596/jalc-2007-333zbMath1149.68384MaRDI QIDQ3517256

Heiko Vogler, Frank Drewes

Publication date: 12 August 2008

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

zbMATH Keywords

algorithmic learning weighted tree automaton

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (9)

On the regularity and learnability of ordered DAG languages ⋮ Learning Tree Languages ⋮ Tree-Based Generation of Restricted Graph Languages ⋮ Learning Rational Stochastic Tree Languages ⋮ Minimizing Deterministic Weighted Tree Automata ⋮ Myhill-Nerode Theorem for Recognizable Tree Series Revisited ⋮ MAT learners for tree series: an abstract data type and two realizations ⋮ Learning algorithms ⋮ Minimizing deterministic weighted tree automata

This page was built for publication:

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