On the public citation graph

Learning Fallible Deterministic Finite Automata

https://doi.org/10.1007/bf00993409
0 signed · 63 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.1006/inco.1993.1021openalex-snapshot
Inference of Finite Automata Using Homing Sequences
inferredcites →https://doi.org/10.1006/inco.1997.2648openalex-snapshot
Efficient Learning of Typical Finite Automata from Random Walks
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-1-4613-1685-5openalex-snapshot
Learning from Good and Bad Data
inferredcites →https://doi.org/10.1007/bf00116829openalex-snapshot
Learning From Noisy Examples
inferredcites →https://doi.org/10.1007/bf00992675openalex-snapshot
Learning conjunctions of Horn clauses
inferredcites →https://doi.org/10.1007/bf00993160openalex-snapshot
Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle
inferredcites →https://doi.org/10.1007/bf00993822openalex-snapshot
Inferring finite automata with stochastic output functions and an application to map learning
inferredcites →https://doi.org/10.1016/0016-0032(54)90574-8openalex-snapshot
The synthesis of sequential switching circuits
inferredcites →https://doi.org/10.1016/0020-0190(87)90114-1openalex-snapshot
Occam's Razor
inferredcites →https://doi.org/10.1016/0020-0190(91)90220-copenalex-snapshot
On learning from queries and counterexamples in the presence of noise
inferredcites →https://doi.org/10.1016/0022-0000(90)90028-jopenalex-snapshot
Prediction-preserving reducibility
inferredcites →https://doi.org/10.1016/0022-0000(93)90044-wopenalex-snapshot
Self-testing/correcting with applications to numerical problems
inferredcites →https://doi.org/10.1016/0890-5401(87)90052-6openalex-snapshot
Learning regular sets from queries and counterexamples
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50022-1openalex-snapshot
AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON
inferredcites →https://doi.org/10.1016/s0019-9958(81)90090-5openalex-snapshot
A note on the number of queries needed to identify regular languages
inferredcites →https://doi.org/10.1016/s0022-0000(05)80062-5openalex-snapshot
Efficient distribution-free learning of probabilistic concepts
inferredcites →https://doi.org/10.1023/a:1022689015665openalex-snapshot
Learning Conjunctions of Horn Clauses
inferredcites →https://doi.org/10.1023/a:1022874607797openalex-snapshot
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1090/dimacs/002/13openalex-snapshot
New directions in testing
inferredcites →https://doi.org/10.1109/sfcs.1987.21openalex-snapshot
Diversity-based inference of finite automata
inferredcites →https://doi.org/10.1109/sfcs.1990openalex-snapshot
Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
inferredcites →https://doi.org/10.1137/0221014openalex-snapshot
On Learning Ring-Sum-Expansions
inferredcites →https://doi.org/10.1137/0221019openalex-snapshot
Learning Integer Lattices
inferredcites →https://doi.org/10.1137/0222047openalex-snapshot
Exact Identification of Read-Once Formulas Using Fixed Points of Amplification Functions
inferredcites →https://doi.org/10.1137/0222052openalex-snapshot
Learning in the Presence of Malicious Errors
inferredcites →https://doi.org/10.1145/130385.130394openalex-snapshot
Learning k -term DNF formulas with an incomplete membership oracle
inferredcites →https://doi.org/10.1145/130385.130418openalex-snapshot
A noise model on learning sets of strings
inferredcites →https://doi.org/10.1145/138027.138061openalex-snapshot
Learning read-once formulas with queries
inferredcites →https://doi.org/10.1145/167088.167191openalex-snapshot
Efficient learning of typical finite automata from random walks
inferredcites →https://doi.org/10.1145/167088.167200openalex-snapshot
Efficient noise-tolerant learning from statistical queries
inferredcites →https://doi.org/10.1145/168304.168336openalex-snapshot
Learning fallible finite state automata
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/1968.1972openalex-snapshot
A theory of the learnable
inferredcites →https://doi.org/10.1145/293347.293351openalex-snapshot
Efficient noise-tolerant learning from statistical queries
inferredcites →https://doi.org/10.1145/3618260openalex-snapshot
Proceedings of the 56th Annual ACM Symposium on Theory of Computing
inferredcites →https://doi.org/10.1145/3749740.3749746openalex-snapshot
A Theory of the Learnable
inferredcites →https://doi.org/10.1214/aoms/1177729330openalex-snapshot
A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential Machines
inferredcites →https://doi.org/10.2307/2964500openalex-snapshot
Edward F. Moore. Gedanken-experiments on sequential machines. Automata studies, edited by C. E. Shannon and J. McCarthy, Annals of Mathematics studies no. 34, litho-printed, Princeton University Press, Princeton1956, pp. 129–153.
inferredcites →https://doi.org/10.5555/93025.93060openalex-snapshot
Types of noise in data for concept learning
inferredcites →https://doi.org/10.5555/93025.93062openalex-snapshot
Learning k-DNF with noise in the attributes

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-60454-5_25openalex-snapshot
Grammatical inference: An old and new paradigm
inferred← citeshttps://doi.org/10.1007/3-540-63438-x_9openalex-snapshot
Machine learning for information extraction
inferred← citeshttps://doi.org/10.1007/978-3-030-61401-0_47openalex-snapshot
Visualization of Membership Distribution in Strings Using Heat Maps
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_27openalex-snapshot
Grammatical Inference and Learning
inferred← citeshttps://doi.org/10.1007/bfb0054002openalex-snapshot
Recursive neural networks and automata
inferred← citeshttps://doi.org/10.1016/j.ecolmodel.2006.12.021openalex-snapshot
Supervised clustering using decision trees and decision graphs: An ecological comparison
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.04.010openalex-snapshot
Learning with errors in answers to membership queries
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/s0304-3975(97)00014-5openalex-snapshot
Recent advances of grammatical inference
inferred← citeshttps://doi.org/10.1023/a:1007311411259openalex-snapshot
Malicious Omissions and Errors in Answers to Membership Queries
inferred← citeshttps://doi.org/10.1023/a:1007348927491openalex-snapshot
Exactly Learning Automata of Small Cover Time
inferred← citeshttps://doi.org/10.1109/focs.2004.37openalex-snapshot
Learning with Errors in Answers to Membership Queries (Extracted Abstract)
inferred← citeshttps://doi.org/10.1109/isdfs.2019.8757487openalex-snapshot
Predicting Daily Activities Effectiveness Using Base-level and Meta level Classifiers
inferred← citeshttps://doi.org/10.1109/sfcs.1995.492489openalex-snapshot
Efficient algorithms for learning to play repeated games against computationally bounded adversaries
inferred← citeshttps://doi.org/10.1109/tnsm.2025.3636946openalex-snapshot
Hyperflex: A SIMD-Based DFA Model for Deep Packet Inspection
inferred← citeshttps://doi.org/10.1109/tpami.2005.147openalex-snapshot
Probabilistic finite-state machines - part I
inferred← citeshttps://doi.org/10.1109/ubmyk48245.2019.8965631openalex-snapshot
Detection of Customer Satisfaction on Unbalanced and Multi-Class Data Using Machine Learning Algorithms
inferred← citeshttps://doi.org/10.1145/180139.181170openalex-snapshot
Learning from a consistently ignorant teacher
inferred← citeshttps://doi.org/10.1145/225298.225350openalex-snapshot
Exactly learning automata with small cover time
inferred← citeshttps://doi.org/10.1145/3376902openalex-snapshot
Indistinguishability
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.