On the public citation graph
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
0 signed · 82 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00202762openalex-snapshot
Dynamical encoding of cursive handwriting
inferredcites →https://doi.org/10.1007/bf00992677openalex-snapshot
On the computational complexity of approximating distributions by probabilistic automata
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1109/34.57669openalex-snapshot
The state of the art in online handwriting recognition
inferredcites →https://doi.org/10.1109/5.18626openalex-snapshot
A tutorial on hidden Markov models and selected applications in speech recognition
inferredcites →https://doi.org/10.1109/massp.1986.1165342openalex-snapshot
An introduction to hidden Markov models
inferredcites →https://doi.org/10.1142/0658openalex-snapshot
Computer Recognition and Human Production of Handwriting
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.1214/aoms/1177699147openalex-snapshot
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/gepi.20216openalex-snapshot
Efficient multilocus association testing for whole genome association studies using localized haplotype clustering
inferred← citeshttps://doi.org/10.1007/11564089_14openalex-snapshot
PAC-Learnability of Probabilistic Deterministic Finite State Automata in Terms of Variation Distance
inferred← citeshttps://doi.org/10.1007/11564089_23openalex-snapshot
Identification in the Limit of Substitutable Context-Free Languages
inferred← citeshttps://doi.org/10.1007/11872436_6openalex-snapshot
PAC-Learning Unambiguous NTS Languages
inferred← citeshttps://doi.org/10.1007/11894841_24openalex-snapshot
Learning Linearly Separable Languages
inferred← citeshttps://doi.org/10.1007/3-540-45164-1_30openalex-snapshot
Dynamic Discretization of Continuous Values from Time Series
inferred← citeshttps://doi.org/10.1007/978-3-031-17244-1_4openalex-snapshot
Non-linear Optimization Methods for Learning Regular Distributions
inferred← citeshttps://doi.org/10.1007/978-3-319-28971-7_15openalex-snapshot
Algorithms for Context Learning and Information Representation for Multi-Sensor Teams
inferred← citeshttps://doi.org/10.1007/978-3-319-96562-8_1openalex-snapshot
Machine Learning for Software Analysis: Models, Methods, and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-77455-6_12openalex-snapshot
A new Procedure to Generate Solar Radiation Time Series from achine Learning Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_13openalex-snapshot
Towards Feasible PAC-Learning of Probabilistic Deterministic Finite Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-13033-5_61openalex-snapshot
An Intelligent Memory Model for Short-Term Prediction: An Application to Global Solar Radiation Data
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_24openalex-snapshot
Learning PDFA with Asynchronous Transitions
inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_17openalex-snapshot
A Lower Bound for Learning Distributions Generated by Probabilistic Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-29627-7_2openalex-snapshot
Ancestry Inference in Complex Admixtures via Variable-Length Markov Chain Linkage Models
inferred← citeshttps://doi.org/10.1007/978-3-642-34106-9_12openalex-snapshot
On the Learnability of Shuffle Ideals
inferred← citeshttps://doi.org/10.1007/s00498-012-0075-1openalex-snapshot
An inner product space on irreducible and synchronizable probabilistic finite state automata
inferred← citeshttps://doi.org/10.1007/s10044-013-0351-9openalex-snapshot
Stacking for multivariate time series classification
inferred← citeshttps://doi.org/10.1007/s10994-013-5408-xopenalex-snapshot
Adaptively learning probabilistic deterministic automata from data streams
inferred← citeshttps://doi.org/10.1007/s10994-013-5416-xopenalex-snapshot
Spectral learning of weighted automata
inferred← citeshttps://doi.org/10.1007/s10994-016-5565-9openalex-snapshot
Learning deterministic probabilistic automata from a model checking perspective
inferred← citeshttps://doi.org/10.1016/j.csda.2015.02.009openalex-snapshot
Modelling discrete longitudinal data using acyclic probabilistic finite automata
inferred← citeshttps://doi.org/10.1016/j.envsoft.2004.04.007openalex-snapshot
Modeling time series of climatic parameters with probabilistic finite automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2012.02.001openalex-snapshot
Vector space formulation of probabilistic finite state automata
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.12.002openalex-snapshot
Grammatical inference of directed acyclic graph languages with polynomial time complexity
inferred← citeshttps://doi.org/10.1016/j.patrec.2012.11.013openalex-snapshot
Picking up the pieces: Causal states in noisy data, and how to recover them
inferred← citeshttps://doi.org/10.1016/j.sigpro.2013.02.002openalex-snapshot
Hilbert space formulation of symbolic systems for signal representation and analysis
inferred← citeshttps://doi.org/10.1016/j.specom.2003.07.003openalex-snapshot
Detecting and extracting named entities from spontaneous speech in a mixed-initiative spoken dialogue context: How May I Help You?sm,tm
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.023openalex-snapshot
PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.06.037openalex-snapshot
Kernel methods for learning languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.009openalex-snapshot
Learning probabilistic automata: A study in state distinguishability
inferred← citeshttps://doi.org/10.1016/s0038-092x(03)00149-xopenalex-snapshot
Using probabilistic finite automata to simulate hourly series of global radiation
inferred← citeshttps://doi.org/10.1023/b:agnt.0000009411.79208.f4openalex-snapshot
Automated Assistants for Analyzing Team Behaviors
inferred← citeshttps://doi.org/10.1086/503876openalex-snapshot
Multilocus Association Mapping Using Variable-Length Markov Chains
inferred← citeshttps://doi.org/10.1086/513205openalex-snapshot
Association Mapping via Regularized Regression Analysis of Single-Nucleotide–Polymorphism Haplotypes in Variable-Sized Sliding Windows
inferred← citeshttps://doi.org/10.1086/521987openalex-snapshot
Rapid and Accurate Haplotype Phasing and Missing-Data Inference for Whole-Genome Association Studies By Use of Localized Haplotype Clustering
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198709022.003.0009openalex-snapshot
Modeling Linkage Disequilibrium and Performing Association Studies through Probabilistic Graphical Models: a Visiting Tour of Recent Advances
inferred← citeshttps://doi.org/10.1098/rsta.2011.0543openalex-snapshot
Abductive learning of quantized stochastic processes with probabilistic finite automata
inferred← citeshttps://doi.org/10.1109/acc.2012.6314719openalex-snapshot
A unified framework for supervised learning of semantic models
inferred← citeshttps://doi.org/10.1109/iccse.2013.6553908openalex-snapshot
An artificial language for data-driven self-adaptation of networked robots in dynamic environments
inferred← citeshttps://doi.org/10.1109/iccse.2013.6554173openalex-snapshot
Autonomous perception and decision-making in cyber-physical systems
inferred← citeshttps://doi.org/10.1109/icmlc.2004.1378554openalex-snapshot
Intrusion detection using adaptive time-dependent finite automata
inferred← citeshttps://doi.org/10.1109/irds.2002.1041501openalex-snapshot
Predictive robot programming
inferred← citeshttps://doi.org/10.1109/iros.2003.1249641openalex-snapshot
Programming complex robot tasks by prediction: experimental results
inferred← citeshttps://doi.org/10.1109/qest.2004.1348029openalex-snapshot
Learning continuous time Markov chains from sample executions
inferred← citeshttps://doi.org/10.1109/qest.2004.22openalex-snapshot
Supporting Dynamic Crosscutting with Partial Behavioral Reflection: A Case Study
inferred← citeshttps://doi.org/10.1109/tac.2024.3354212openalex-snapshot
A Bisimulation-Based Foundation for Scale Reductions of Continuous-Time Markov Chains
inferred← citeshttps://doi.org/10.1109/tase49443.2020.00026openalex-snapshot
Learning Probabilistic Languages by k-Testable Machines
inferred← citeshttps://doi.org/10.1111/tops.12001openalex-snapshot
Complexity in Language Acquisition
inferred← citeshttps://doi.org/10.1145/1060590.1060645openalex-snapshot
Learning nonsingular phylogenies and hidden Markov models
inferred← citeshttps://doi.org/10.1145/1935826.1935921openalex-snapshot
Shopping for products you don't know you need
inferred← citeshttps://doi.org/10.1145/3324884.3416592openalex-snapshot
Towards interpreting recurrent neural networks through probabilistic abstraction
inferred← citeshttps://doi.org/10.11606/d.45.2007.tde-25112009-151237openalex-snapshot
MYOP: um arcabouço para predição de genes ab initio"
inferred← citeshttps://doi.org/10.11606/d.95.2018.tde-02012018-144349openalex-snapshot
Predição computacional de sítios de ligação de fatores de transcrição baseada em gramáticas regulares estocásticas
inferred← citeshttps://doi.org/10.11606/d.95.2021.tde-18012022-104802openalex-snapshot
Análise de dependência entre posições de bases de sequências motivos de fatores de transcrição aplicada à comparação de modelos baseados em Position Weight Matrix e Gramática Regular Estocástica
inferred← citeshttps://doi.org/10.1162/coli_a_00092openalex-snapshot
Empirical Risk Minimization for Probabilistic Grammars: Sample Complexity and Hardness of Learning
inferred← citeshttps://doi.org/10.1177/0278364904044401openalex-snapshot
Predictive Robot Programming: Theoretical and Experimental Analysis
inferred← citeshttps://doi.org/10.1177/1471082x14551248openalex-snapshot
Context-specific graphical models for discrete longitudinal data
inferred← citeshttps://doi.org/10.1186/1471-2105-14-179openalex-snapshot
Modelling and visualizing fine-scale linkage disequilibrium structure
inferred← citeshttps://doi.org/10.1186/s12859-015-0802-yopenalex-snapshot
Two molecular measures of relatedness based on haplotype sharing
inferred← citeshttps://doi.org/10.1371/journal.pcbi.1002877openalex-snapshot
Multi-Population Classical HLA Type Imputation
inferred← citeshttps://doi.org/10.1515/ijb-2016-0073openalex-snapshot
Adaptation of Chain Event Graphs for use with Case-Control Studies in Epidemiology
inferred← citeshttps://doi.org/10.1590/1678-4685-gmb-2023-0048openalex-snapshot
Position Weight Matrix or Acyclic Probabilistic Finite Automaton: Which model to use? A decision rule inferred for the prediction of transcription factor binding sites
inferred← citeshttps://doi.org/10.1609/aaai.v37i8.26147openalex-snapshot
Automata Cascades: Expressivity and Sample Complexity
inferred← citeshttps://doi.org/10.1613/jair.874openalex-snapshot
Learning Geometrically-Constrained Hidden Markov Models for Robot Navigation: Bridging the Topological-Geometrical Gap
inferred← citeshttps://doi.org/10.2478/v10006-012-0053-2openalex-snapshot
KIS: An automated attribute induction method for classification of DNA sequences
inferred← citeshttps://doi.org/10.24963/ijcai.2022/473openalex-snapshot
Markov Abstractions for PAC Reinforcement Learning in Non-Markov Decision Processes
inferred← citeshttps://doi.org/10.25300/misq/2016/40.4.10openalex-snapshot
Comprehensible Predictive Models for Business Processes1
inferred← citeshttps://doi.org/10.3115/1073012.1073051openalex-snapshot
Information extraction from voicemail
inferred← citeshttps://doi.org/10.3389/fncom.2023.1082502openalex-snapshot
An information theoretic score for learning hierarchical concepts
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95067openalex-snapshot
Learning finite-state machines: statistical and algorithmic aspects
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.