Abductive learning of quantized stochastic processes with probabilistic finite automata

DOI10.1098/RSTA.2011.0543MaRDI QIDQ2955468zbMATH OpenOpenAlexWikidataFDO

Authors Ishanu Chattopadhyay, Hod Lipson

Publication date 13 January 2017

Published in Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1098/rsta.2011.0543

Mathematics Subject Classification ID

Time series analysis of dynamical systems (37M10) Special processes (60K99) Nonparametric estimation (62G05) Asymptotic properties of nonparametric inference (62G20) Formal languages and automata (68Q45) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning probability distributions generated by finite-state machines
• scientific article; zbMATH DE number 2019596
• Learning Theory
• Grammatical Inference: Algorithms and Applications
• Quantum learning of classical stochastic processes: the completely positive realization problem

Cites work

• A theory of the learnable
• Automated pattern detection -- an algorithm for constructing optimally synchronizing multi-regular language filters
• Automated reverse engineering of nonlinear dynamical systems
• Contradictory relationship between Hurst parameter and queueing performance (extended version)
• Depth-First Search and Linear Graph Algorithms
• Estimating long-range dependence in the presence of periodicity: An empirical study
• Long memory processes and fractional integration in econometrics
• On the inference of stochastic regular grammars
• On the learnability and usage of acyclic probabilistic finite automata
• Queries revisited.
• Sanov property, generalized I-projection and a conditional limit theorem
• Stock market prices and long-range dependence
• Structural transformations of probabilistic finite state machines

Cited in

(2)

• Quantum learning of classical stochastic processes: the completely positive realization problem
• Learning and designing stochastic processes from logical constraints

This page was built for publication: Abductive learning of quantized stochastic processes with probabilistic finite automata

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