Learning PDFA with Asynchronous Transitions

DOI10.1007/978-3-642-15488-1_24MaRDI QIDQ3588386zbMATH OpenOpenAlexFDO

Authors Borja Balle, Ricard Gavaldà, Jorge Castro

Publication date 10 September 2010

Published in Grammatical Inference: Theoretical Results and Applications (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2117/10553

Mathematics Subject Classification ID

Computational learning theory (68Q32) Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Learning dynamics with synchronous, asynchronous and general semantics
• Asynchronous stochastic approximation and Q-learning
• Asynchronous non-Bayesian learning in the presence of crash failures
• Revisiting log-linear learning: asynchrony, completeness and payoff-based implementation
• Learning from interpretation transition
• Asynchronous Adaptation and Learning Over Networks—Part II: Performance Analysis
• Asynchronous cellular learning automata
• Asynchronous Adaptation and Learning Over Networks—Part III: Comparison Analysis
• Multitask Diffusion Adaptation Over<?Pub _newline ?>Asynchronous Networks

This page was built for publication: Learning PDFA with Asynchronous Transitions

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