On the public citation graph

Polynomial Time Learnability of Simple Deterministic Languages

https://doi.org/10.1007/bf00116035
0 signed · 54 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.1007/3-540-19426-6_12openalex-snapshot
Inductive inference of regular languages based on model inference
inferredcites →https://doi.org/10.1007/3-540-51734-0_50openalex-snapshot
Inductive inference, DFAs, and computational complexity
inferredcites →https://doi.org/10.1007/978-3-662-03563-4_4openalex-snapshot
Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot
Queries and Concept Learning
inferredcites →https://doi.org/10.1016/0022-0000(90)90028-jopenalex-snapshot
Prediction-preserving reducibility
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
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-934613-64-4.50040-2openalex-snapshot
Machine Invention of First-order Predicates by Inverting Resolution
inferredcites →https://doi.org/10.1080/00207168908803708openalex-snapshot
Inductive inference of regular languages based on model inference
inferredcites →https://doi.org/10.1109/sfcs.1987.36openalex-snapshot
Learning one-counter languages in polynomial time
inferredcites →https://doi.org/10.5555/93025.93100openalex-snapshot
Learning theories in a subset of a polyadic logic
inferredcites →https://doi.org/10.7551/mitpress/1192.001.0001openalex-snapshot
Algorithmic Program Debugging

What points at this work

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

inferred← citeshttps://doi.org/10.1002/stvr.4370020204openalex-snapshot
Inductive inference and software testing
inferred← citeshttps://doi.org/10.1007/3-540-33486-6_7openalex-snapshot
Computational Grammatical Inference
inferred← citeshttps://doi.org/10.1007/3-540-44669-9_18openalex-snapshot
Prediction-Preserving Reducibility with Membership Queries on Formal Languages
inferred← citeshttps://doi.org/10.1007/3-540-45790-9_20openalex-snapshot
A PAC Learnability of Simple Deterministic Languages
inferred← citeshttps://doi.org/10.1007/3-540-49730-7_30openalex-snapshot
Consistent Polynomial Identification in the Limit
inferred← citeshttps://doi.org/10.1007/3-540-57369-0_26openalex-snapshot
On learning systolic languages
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-60454-5_28openalex-snapshot
Language learning from membership queries and characteristic examples
inferred← citeshttps://doi.org/10.1007/3-540-61863-5_45openalex-snapshot
Constructive learning of translations based on dictionaries
inferred← citeshttps://doi.org/10.1007/978-3-031-82697-9_16openalex-snapshot
Query Learning of Context-Deterministic and Congruential Context-Free Languages over Infinite Alphabets
inferred← citeshttps://doi.org/10.1007/978-3-319-08019-2_3openalex-snapshot
How can Grammatical Inference Contribute to Computational Linguistics?
inferred← citeshttps://doi.org/10.1007/978-3-540-30195-0_31openalex-snapshot
An Analysis of Examples and a Search Space for PAC Learning of Simple Deterministic Languages with Membership Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-39886-8_27openalex-snapshot
Grammatical Inference and Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_22openalex-snapshot
Constructive Learning of Context-Free Languages with a Subpansive Tree
inferred← citeshttps://doi.org/10.1007/978-3-540-45257-7_23openalex-snapshot
A Polynomial Time Learning Algorithm of Simple Deterministic Languages via Membership Queries and a Representative Sample
inferred← citeshttps://doi.org/10.1007/bf00992674openalex-snapshot
Lower Bound Methods and Separation Results for On-Line Learning Models
inferred← citeshttps://doi.org/10.1007/bf00993160openalex-snapshot
Randomly Fallible Teachers: Learning Monotone DNF with an Incomplete Membership Oracle
inferred← citeshttps://doi.org/10.1007/bf01201279openalex-snapshot
Learning two-tape automata from queries and counterexamples
inferred← citeshttps://doi.org/10.1007/pl00001593openalex-snapshot
Complexity theoretic hardness results for query learning
inferred← citeshttps://doi.org/10.1007/s00224-005-1233-3openalex-snapshot
Query Learning of Regular Tree Languages: How to Avoid Dead States
inferred← citeshttps://doi.org/10.1007/s10994-006-9593-8openalex-snapshot
LARS: A learning algorithm for rewriting systems
inferred← citeshttps://doi.org/10.1016/b978-0-08-051053-8.50014-4openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-1-55860-213-7.50016-xopenalex-snapshot
Learning Monotone DNF with an Incomplete Membership Oracle
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.008openalex-snapshot
A survey of grammatical inference in software engineering
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.08.012openalex-snapshot
Polynomial time learning of simple deterministic languages via queries and a representative sample
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00014-5openalex-snapshot
Recent advances of grammatical inference
inferred← citeshttps://doi.org/10.1080/00207721.2012.724098openalex-snapshot
Input–output identification of controlled discrete manufacturing systems
inferred← citeshttps://doi.org/10.1109/icsmc.2009.5346599openalex-snapshot
Off-line identification of concurrent Discrete Event Systems exhibiting cyclic behaviour
inferred← citeshttps://doi.org/10.1109/sfcs.1992.267799openalex-snapshot
Read-thrice DNF is hard to learn with membership and equivalence queries
inferred← citeshttps://doi.org/10.1109/tfuzz.2009.2020155openalex-snapshot
Language Structure Using Fuzzy Similarity
inferred← citeshttps://doi.org/10.1145/168304.168338openalex-snapshot
Learning two-tape automata from queries and counterexamples
inferred← citeshttps://doi.org/10.1145/3062341.3062349openalex-snapshot
Synthesizing program input grammars
inferred← citeshttps://doi.org/10.1145/3140587.3062349openalex-snapshot
Synthesizing program input grammars
inferred← citeshttps://doi.org/10.1145/3338906.3338958openalex-snapshot
REINAM: reinforcement learning for input-grammar inference
inferred← citeshttps://doi.org/10.1145/3832783.3834391openalex-snapshot
Learning the Lexical Structure of Black-Box Systems by Parsing Systematic String Edit Mutations
inferred← citeshttps://doi.org/10.1155/2010/453254openalex-snapshot
A Comparative Analysis of Recent Identification Approaches for Discrete‐Event Systems
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.2733openalex-snapshot
Teachability of a Subclass of Simple Deterministic Languages
inferred← citeshttps://doi.org/10.25596/jalc-2007-333openalex-snapshot
Learning Deterministically Recognizable Tree Series
inferred← citeshttps://doi.org/10.48550/arxiv.1207.0052openalex-snapshot
The Complexity of Learning Principles and Parameters Grammars
inferred← citeshttps://doi.org/10.5109/13472openalex-snapshot
THE LEARNABILITY OF SIMPLE DETERMINISTIC FINITE-MEMORY AUTOMATA VIA QUERIES
inferred← citeshttps://doi.org/10.5555/114836.114849openalex-snapshot
Learning monotone DNF with an incomplete membership oracle
inferred← citeshttps://doi.org/10.70675/800fec2ez9281z4b5cz95f8z2e75986db155openalex-snapshot
Black-Box identification of automated discrete event systems
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.