On the public citation graph

Ten Open Problems in Grammatical Inference

0 signed · 46 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-18081-8openalex-snapshot
Analogical and Inductive Inference
inferredcites →https://doi.org/10.1007/3-540-45164-1openalex-snapshot
Machine Learning: ECML 2000
inferredcites →https://doi.org/10.1007/3-540-45164-1_11openalex-snapshot
Wrapper Generation via Grammar Induction
inferredcites →https://doi.org/10.1007/3-540-45583-3_3openalex-snapshot
Queries Revisited
inferredcites →https://doi.org/10.1007/3-540-45790-9_13openalex-snapshot
Learning Languages with Help
inferredcites →https://doi.org/10.1007/3-540-45923-5_6openalex-snapshot
Model Generation by Moderated Regular Extrapolation
inferredcites →https://doi.org/10.1007/3-540-51734-0_50openalex-snapshot
Inductive inference, DFAs, and computational complexity
inferredcites →https://doi.org/10.1007/3-540-58473-0openalex-snapshot
Grammatical Inference and Applications
inferredcites →https://doi.org/10.1007/3-540-58473-0_144openalex-snapshot
Learning stochastic regular grammars by means of a state merging method
inferredcites →https://doi.org/10.1007/978-3-540-39624-6_5openalex-snapshot
Can Learning in the Limit Be Done Efficiently?
inferredcites →https://doi.org/10.1007/978-3-540-45257-7_17openalex-snapshot
On the Relationship between Models for Learning in Helpful Environments
inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot
Queries and Concept Learning
inferredcites →https://doi.org/10.1007/bf03037351openalex-snapshot
The query complexity of learning DFA
inferredcites →https://doi.org/10.1007/bfb0054077openalex-snapshot
Learning regular grammars to model musical style: Comparing different coding schemes
inferredcites →https://doi.org/10.1007/bfb0054079openalex-snapshot
Using symbol clustering to improve probabilistic automaton inference
inferredcites →https://doi.org/10.1007/s10994-006-9613-8openalex-snapshot
Interactive learning of node selecting tree transducer
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/s0019-9958(67)91165-5openalex-snapshot
Language identification in the limit
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.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/s0304-3975(02)00423-1openalex-snapshot
Polynomial-time identification of very simple grammars from positive data
inferredcites →https://doi.org/10.1023/a:1007353007695openalex-snapshot
Characteristic Sets for Polynomial Grammatical Inference
inferredcites →https://doi.org/10.1023/a:1007477814995openalex-snapshot
Predicting Protein Secondary Structure Using Stochastic Tree Grammars
inferredcites →https://doi.org/10.1023/a:1007653929870openalex-snapshot
Stochastic Grammatical Inference of Text Database Structure
inferredcites →https://doi.org/10.1023/a:1010007108196openalex-snapshot
Exploration Strategies for Model-based Learning in Multi-agent Systems: Exploration Strategies
inferredcites →https://doi.org/10.1023/a:1010884214864openalex-snapshot
Noisy Time Series Prediction using Recurrent Neural Networks and Grammatical Inference
inferredcites →https://doi.org/10.1023/a:1011116115948openalex-snapshot
The EuTrans Spoken Language Translation System
inferredcites →https://doi.org/10.1093/nar/22.23.5112openalex-snapshot
Stochastic context-free grammers for tRNA modeling
inferredcites →https://doi.org/10.1109/tpami.1979.4766901openalex-snapshot
Syntactic Decision Rules for Recognition of Spoken Words and Phrases Using a Stochastic Automaton
inferredcites →https://doi.org/10.1109/tpami.2005.147openalex-snapshot
Probabilistic finite-state machines - part I
inferredcites →https://doi.org/10.1145/225298.225302openalex-snapshot
On the learnability and usage of acyclic probabilistic finite automata
inferredcites →https://doi.org/10.1145/337244.337257openalex-snapshot
Learning functions represented as multiplicity automata
inferredcites →https://doi.org/10.48550/arxiv.1207.1388openalex-snapshot
Planning in POMDPs Using Multiplicity Automata
inferredcites →https://doi.org/10.5860/choice.26-3305openalex-snapshot
An introduction to formal language theory

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-642-14684-8_1openalex-snapshot
Learning Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-642-14684-8_15openalex-snapshot
Zulu: An Interactive Learning Competition
inferred← citeshttps://doi.org/10.1007/978-3-642-36089-3_12openalex-snapshot
Grammatical Inference in Software Engineering: An Overview of the State of the Art
inferred← citeshttps://doi.org/10.1007/978-3-662-48395-4_3openalex-snapshot
Learning Grammars and Automata with Queries
inferred← citeshttps://doi.org/10.1016/b978-0-12-822116-7.00002-1openalex-snapshot
State of the art
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.swevo.2016.05.002openalex-snapshot
Maintaining regularity and generalization in data using the minimum description length principle and genetic algorithm: Case of grammatical inference
inferred← citeshttps://doi.org/10.1109/tsmcc.2012.2186802openalex-snapshot
Improving Grammar Inference by a Memetic Algorithm
inferred← citeshttps://doi.org/10.1162/ling_a_00015openalex-snapshot
Learning Long-Distance Phonotactics
inferred← citeshttps://doi.org/10.2200/s00643ed1v01y201504hlt028openalex-snapshot
Grammatical Inference for Computational Linguistics
inferred← citeshttps://doi.org/10.37936/ecti-cit.201151.54230openalex-snapshot
Characteristic Sets for Learning k-Acceptable Languages
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.