On the public citation graph

On the computational complexity of approximating distributions by probabilistic automata

0 signed · 79 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1983.tb03114.xopenalex-snapshot
An Introduction to the Application of the Theory of Probabilistic Functions of a Markov Process to Automatic Speech Recognition
inferredcites →https://doi.org/10.1007/978-1-4612-5254-2openalex-snapshot
Convergence of Stochastic Processes
inferredcites →https://doi.org/10.1016/s0019-9958(78)90562-4openalex-snapshot
Complexity of automaton identification from given data
inferredcites →https://doi.org/10.1016/s0019-9958(78)90683-6openalex-snapshot
On the complexity of minimum inference of regular sets
inferredcites →https://doi.org/10.1109/sct.1989.41829openalex-snapshot
The minimum consistent DFA problem cannot be approximated within any polynomial
inferredcites →https://doi.org/10.1109/sfcs.1989.63489openalex-snapshot
The equivalence and learning of probabilistic automata
inferredcites →https://doi.org/10.1109/tit.1967.1053968openalex-snapshot
A lower bound for discrimination information in terms of variation (Corresp.)
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.5555/114836.114863openalex-snapshot
Polynomial learnability of probabilistic concepts with respect to the Kullback-Leibler divergence

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118346136.ch17openalex-snapshot
Learnability
inferred← citeshttps://doi.org/10.1002/9781444324044.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/9781444390568.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1006/jcss.1997.1555openalex-snapshot
On the Learnability and Usage of Acyclic Probabilistic Finite Automata
inferred← citeshttps://doi.org/10.1007/3-540-57369-0_40openalex-snapshot
Some improved sample complexity bounds in the probabilistic PAC learning model
inferred← citeshttps://doi.org/10.1007/3-540-58520-6_64openalex-snapshot
Towards realistic theories of learning
inferred← citeshttps://doi.org/10.1007/978-3-319-24486-0_12openalex-snapshot
On the Rademacher Complexity of Weighted Automata
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-662-48395-4openalex-snapshot
Topics in Grammatical Inference
inferred← citeshttps://doi.org/10.1007/978-3-662-48395-4_7openalex-snapshot
Learning Tree Languages
inferred← citeshttps://doi.org/10.1007/bf01000408openalex-snapshot
Discrete Sequence Prediction and Its Applications
inferred← citeshttps://doi.org/10.1007/bfb0030387openalex-snapshot
On the sample complexity of various learning strategies in the probabilistic PAC learning paradigms
inferred← citeshttps://doi.org/10.1007/s10707-022-00465-2openalex-snapshot
Online fleet monitoring with scalable event recognition and forecasting
inferred← citeshttps://doi.org/10.1016/b978-0-444-51747-0.50013-5openalex-snapshot
Computational Learning Theory and Language Acquisition
inferred← citeshttps://doi.org/10.1016/j.jcss.2014.12.027openalex-snapshot
A multi-parameter analysis of hard problems on deterministic finite automata
inferred← citeshttps://doi.org/10.1016/j.patcog.2004.03.020openalex-snapshot
Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms
inferred← citeshttps://doi.org/10.1016/j.patcog.2005.01.003openalex-snapshot
A bibliographical study of grammatical inference
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.2012.10.009openalex-snapshot
Learning probabilistic automata: A study in state distinguishability
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.09.023openalex-snapshot
Regular inference as vertex coloring
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.023openalex-snapshot
Generalization bounds for learning weighted automata
inferred← citeshttps://doi.org/10.1016/s0022-0000(02)00009-0openalex-snapshot
The consensus string problem and the complexity of comparing hidden Markov models
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00014-5openalex-snapshot
Recent advances of grammatical inference
inferred← citeshttps://doi.org/10.1023/a:1007469218079openalex-snapshot
The Hierarchical Hidden Markov Model: Analysis and Applications
inferred← citeshttps://doi.org/10.1023/a:1022641132503openalex-snapshot
A Learning Criterion for Stochastic Rules
inferred← citeshttps://doi.org/10.1023/a:1026490906255openalex-snapshot
The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length
inferred← citeshttps://doi.org/10.1075/cilt.229.05peropenalex-snapshot
1. Formal grammar and information theory: together again?
inferred← citeshttps://doi.org/10.1089/106652700750050844openalex-snapshot
Optimal Amnesic Probabilistic Automata or How to Learn and Classify Proteins in Linear Time and Space
inferred← citeshttps://doi.org/10.1093/bioinformatics/btl515openalex-snapshot
A supervised hidden markov model framework for efficiently segmenting tiling array data in transcriptional and chIP-chip experiments: systematically incorporating validated biological knowledge
inferred← citeshttps://doi.org/10.1093/bioinformatics/bts121openalex-snapshot
Probabilistic suffix array: efficient modeling and prediction of protein families
inferred← citeshttps://doi.org/10.1098/rsta.2000.0583openalex-snapshot
Formal grammar and information theory: together again?
inferred← citeshttps://doi.org/10.1109/34.232080openalex-snapshot
PAC learning with generalized samples and an applicaiton to stochastic geometry
inferred← citeshttps://doi.org/10.1109/34.955112openalex-snapshot
Hidden Markov models with patterns to learn Boolean vector sequences and applications to the built-in self-test for integrated circuits
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/isit.1994.394627openalex-snapshot
Inferring probabilistic acyclic automata using the minimum description length principle
inferred← citeshttps://doi.org/10.1109/jstsp.2012.2237378openalex-snapshot
Engineering Statistical Behaviors for Attacking and Defending Covert Channels
inferred← citeshttps://doi.org/10.1109/spire.2001.989732openalex-snapshot
Of maps bigger than the empire
inferred← citeshttps://doi.org/10.1109/sysose.2017.7994961openalex-snapshot
Deriving stochastic properties from behavior models defined by Monterey Phoenix
inferred← citeshttps://doi.org/10.1109/tpami.2005.140openalex-snapshot
Grammatical inference in bioinformatics
inferred← citeshttps://doi.org/10.1109/tpami.2005.147openalex-snapshot
Probabilistic finite-state machines - part I
inferred← citeshttps://doi.org/10.1109/tpami.2005.148openalex-snapshot
Probabilistic finite-state machines - part II
inferred← citeshttps://doi.org/10.1109/tsmcb.2002.1049608openalex-snapshot
Generalized pursuit learning schemes: new families of continuous and discretized learning automata
inferred← citeshttps://doi.org/10.1109/tsmcb.2009.2027220openalex-snapshot
Modeling a Student's Behavior in a Tutorial-Like System Using Learning Automata
inferred← citeshttps://doi.org/10.1109/uemcon.2016.7777807openalex-snapshot
A study on compression-based sequential prediction methods for occupancy prediction in smart homes
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/129712.129746openalex-snapshot
Computational learning theory
inferred← citeshttps://doi.org/10.1145/180139.181091openalex-snapshot
Inference and minimization of hidden Markov chains
inferred← citeshttps://doi.org/10.1145/195058.195155openalex-snapshot
On the learnability of discrete distributions
inferred← citeshttps://doi.org/10.1145/225298.225302openalex-snapshot
On the learnability and usage of acyclic probabilistic finite automata
inferred← citeshttps://doi.org/10.1145/225298.225303openalex-snapshot
Learning to model sequences generated by switching distributions
inferred← citeshttps://doi.org/10.1145/225298.225342openalex-snapshot
On learning bounded-width branching programs
inferred← citeshttps://doi.org/10.1145/267460.267517openalex-snapshot
Learning Markov chains with variable memory length from noisy output
inferred← citeshttps://doi.org/10.1145/299432.299445openalex-snapshot
Modeling protein families using probabilistic suffix trees
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.1214/105051606000000024openalex-snapshot
Learning nonsingular phylogenies and hidden Markov models
inferred← citeshttps://doi.org/10.14738/tnc.42.1989openalex-snapshot
Topological Analysis of Network Systems for Intrusion Detections
inferred← citeshttps://doi.org/10.1609/aaai.v35i10.17107openalex-snapshot
Learning of Structurally Unambiguous Probabilistic Grammars
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.2200/s00643ed1v01y201504hlt028openalex-snapshot
Grammatical Inference for Computational Linguistics
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.4068openalex-snapshot
Learning discrete Hidden Markov Models from state distribution vectors
inferred← citeshttps://doi.org/10.3156/jfuzzy.7.5_931openalex-snapshot
Probabilistic Knowledge Acquisition and Probabilistic Inference
inferred← citeshttps://doi.org/10.33915/etd.3402openalex-snapshot
Suffix Structures and Circular Pattern Problems
inferred← citeshttps://doi.org/10.4018/978-1-4666-2455-9.ch052openalex-snapshot
Classification of Biological Sequences
inferred← citeshttps://doi.org/10.4018/978-1-61350-056-9.ch007openalex-snapshot
Classification of Biological Sequences
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:10)2023openalex-snapshot
Learning of Structurally Unambiguous Probabilistic Grammars
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.