On the public citation graph
Polynomial-time learning of elementary formal systems
0 signed · 58 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/3-540-11980-9_19openalex-snapshot
Polynomial time inference of extended regular pattern languages
inferredcites →https://doi.org/10.1007/3-540-57370-4_42openalex-snapshot
Inductive inference machines that can refute hypothesis spaces
inferredcites →https://doi.org/10.1007/3-540-57370-4_47openalex-snapshot
Properties of language classes with finite elasticity
inferredcites →https://doi.org/10.1007/bf01200064openalex-snapshot
Three ? P 2 -complete problems in computational learning theory
inferredcites →https://doi.org/10.1016/0022-0000(80)90036-7openalex-snapshot
Tree-size bounded alternation
inferredcites →https://doi.org/10.1016/0022-0000(80)90041-0openalex-snapshot
Finding patterns common to a set of strings
inferredcites →https://doi.org/10.1016/0022-0000(81)90038-6openalex-snapshot
On uniform circuit complexity
inferredcites →https://doi.org/10.1016/0304-3975(92)90068-qopenalex-snapshot
Learning elementary formal system
inferredcites →https://doi.org/10.1016/0743-1066(92)90022-uopenalex-snapshot
Short note: procedural semantics and negative information of elementary formal system
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/0890-5401(91)90042-zopenalex-snapshot
Equivalence of models for polynomial learnability
inferredcites →https://doi.org/10.1016/b978-0-12-037102-0.50010-8openalex-snapshot
On Learning Smullyan's Elementary Formal Systems: Towards an Efficient Learning Method for Context-Sensitive Languages* *This work forms part of the major R&D on the Fifth Generation Computer Project, conducted under a program set up by MITI.
inferredcites →https://doi.org/10.1016/b978-1-55860-146-8.50010-2openalex-snapshot
INDUCTIVE INFERENCE FROM POSITIVE DATA IS POWERFUL
inferredcites →https://doi.org/10.1016/b978-1-55860-146-8.50012-6openalex-snapshot
Pattern Languages Are Not Learnable
inferredcites →https://doi.org/10.1016/b978-1-55860-213-7.50036-5openalex-snapshot
On the Complexity of Learning Strings and Sequences
inferredcites →https://doi.org/10.1016/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
inferredcites →https://doi.org/10.1016/s0022-0000(05)80068-6openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferredcites →https://doi.org/10.1109/hicss.1992.183220openalex-snapshot
A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains
inferredcites →https://doi.org/10.1109/sfcs.1989.63455openalex-snapshot
Efficient NC algorithms for set cover with applications to learning and geometry
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem
inferredcites →https://doi.org/10.1145/322063.322075openalex-snapshot
The Complexity of Some Problems on Subsequences and Supersequences
inferredcites →https://doi.org/10.1145/322077.322083openalex-snapshot
On the Tape Complexity of Deterministic Context-Free Languages
inferredcites →https://doi.org/10.1145/76359.76371openalex-snapshot
Learnability and the Vapnik-Chervonenkis dimension
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
inferredcites →https://doi.org/10.1515/9781400882007openalex-snapshot
Theory of Formal Systems. (AM-47)
inferredcites →https://doi.org/10.3115/982023.982051openalex-snapshot
Polynomial learnability and locality of formal grammars
inferredcites →https://doi.org/10.5555/114836.114870openalex-snapshot
On the complexity of learning strings and sequences
inferredcites →https://doi.org/10.5555/92571.92593openalex-snapshot
Inductive inference from positive data is powerful
inferredcites →https://doi.org/10.5555/92571.92613openalex-snapshot
Pattern languages are not learnable
inferredcites →https://doi.org/10.5555/93025.93040openalex-snapshot
Equivalence of models for polynomial learnability
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11563983_6openalex-snapshot
Practical Algorithms for Pattern Based Linear Regression
inferred← citeshttps://doi.org/10.1007/11963578_9openalex-snapshot
Inductive Logic Programming: Yet Another Application of Logic
inferred← citeshttps://doi.org/10.1007/3-540-36182-0_10openalex-snapshot
Discovering Best Variable-Length-Don’t-Care Patterns
inferred← citeshttps://doi.org/10.1007/3-540-44418-1_12openalex-snapshot
A Practical Algorithm to Find the Best Subsequence Patterns
inferred← citeshttps://doi.org/10.1007/3-540-44418-1_5openalex-snapshot
A Unifying Approach to HTML Wrapper Representation and Learning
inferred← citeshttps://doi.org/10.1007/3-540-45583-3_25openalex-snapshot
Extending Elementary Formal Systems
inferred← citeshttps://doi.org/10.1007/3-540-45650-3_37openalex-snapshot
A Practical Algorithm to Find the Best Episode Patterns
inferred← citeshttps://doi.org/10.1007/3-540-45884-0_21openalex-snapshot
Finding Best Patterns Practically
inferred← citeshttps://doi.org/10.1007/978-3-540-39624-6_19openalex-snapshot
Learning a Subclass of Regular Patterns in Polynomial Time
inferred← citeshttps://doi.org/10.1007/978-3-540-39624-6_5openalex-snapshot
Can Learning in the Limit Be Done Efficiently?
inferred← citeshttps://doi.org/10.1007/s10878-013-9609-9openalex-snapshot
On the hardness of learning queries from tree structured data
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.042openalex-snapshot
From learning in the limit to stochastic finite learning
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.044openalex-snapshot
Learning a subclass of regular patterns in polynomial time
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.035openalex-snapshot
Revisiting Shinohara's algorithm for computing descriptive patterns
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00182-2openalex-snapshot
A practical algorithm to find the best subsequence patterns
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00417-6openalex-snapshot
Learning elementary formal systems with queries
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00418-8openalex-snapshot
Advanced elementary formal systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00419-xopenalex-snapshot
Decision lists over regular patterns
inferred← citeshttps://doi.org/10.1109/spw.2015.17openalex-snapshot
Grammatical Inference and Language Frameworks for LANGSEC
inferred← citeshttps://doi.org/10.1145/2274576.2274592openalex-snapshot
Learning twig and path queries
inferred← citeshttps://doi.org/10.1587/transfun.2022eap1052openalex-snapshot
Parameterized Formal Graph Systems and Their Polynomial-Time PAC Learnability
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.