Abductive learning of quantized stochastic processes with probabilistic finite automata
DOI10.1098/rsta.2011.0543zbMath1353.68230OpenAlexW2053530918WikidataQ50767491 ScholiaQ50767491MaRDI QIDQ2955468
Hod Lipson, Ishanu Chattopadhyay
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
Asymptotic properties of nonparametric inference (62G20) Nonparametric estimation (62G05) Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Special processes (60K99) Time series analysis of dynamical systems (37M10)
Cites Work
- Estimating long-range dependence in the presence of periodicity: An empirical study
- Sanov property, generalized I-projection and a conditional limit theorem
- On the learnability and usage of acyclic probabilistic finite automata
- Stock market prices and long-range dependence
- Queries revisited.
- Contradictory relationship between Hurst parameter and queueing performance (extended version)
- Long memory processes and fractional integration in econometrics
- Automated pattern detection -- an algorithm for constructing optimally synchronizing multi-regular language filters
- Structural transformations of probabilistic finite state machines
- Automated reverse engineering of nonlinear dynamical systems
- A theory of the learnable
- On the inference of stochastic regular grammars
- Depth-First Search and Linear Graph Algorithms
This page was built for publication: Abductive learning of quantized stochastic processes with probabilistic finite automata
