On the public citation graph
Negative Results for Equivalence Queries
0 signed · 222 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-56483-7_21openalex-snapshot
Cryptographic limitations on learning Boolean formulae and finite automata
inferredcites →https://doi.org/10.1007/bf00114841openalex-snapshot
Learning automata from ordered examples
inferredcites →https://doi.org/10.1007/bf00116034openalex-snapshot
Negative Results for Equivalence Queries
inferredcites →https://doi.org/10.1007/bf00116827openalex-snapshot
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
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-08-094829-4.50012-xopenalex-snapshot
Equivalence Queries and Approximate Fingerprints
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.1023/a:1022869011914openalex-snapshot
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm
inferredcites →https://doi.org/10.1109/sct.1988.5263openalex-snapshot
Reductions among prediction problems: on the difficulty of predicting automata
inferredcites →https://doi.org/10.1109/sfcs.1987.37openalex-snapshot
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
inferredcites →https://doi.org/10.1109/sfcs.1988.21928openalex-snapshot
Predicting (0, 1)-functions on randomly drawn points
inferredcites →https://doi.org/10.1145/138027.138061openalex-snapshot
Learning read-once formulas with queries
inferredcites →https://doi.org/10.1145/174644.174647openalex-snapshot
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
inferredcites →https://doi.org/10.1145/322326.322334openalex-snapshot
Inference of Reversible Languages
inferredcites →https://doi.org/10.1145/73007.73049openalex-snapshot
Crytographic limitations on learning Boolean formulae and finite automata
inferredcites →https://doi.org/10.21236/ada206851openalex-snapshot
Learning Automata from Ordered Examples
inferredcites →https://doi.org/10.5555/93025.93040openalex-snapshot
Equivalence of models for polynomial learnability
inferredcites →https://doi.org/10.5555/93025.93109openalex-snapshot
Learning context-free grammars from structural data in polynomial time
inferredcites →https://doi.org/10.5555/93025.93114openalex-snapshot
Learning regular languages from counterexamples
inferredcites →https://doi.org/10.5555/93335.93351openalex-snapshot
Equivalence queries and approximate fingerprints
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.1006/inco.2001.3065openalex-snapshot
The Query Complexity of Finding Local Minima in the Lattice
inferred← citeshttps://doi.org/10.1006/jcss.1997.1533openalex-snapshot
An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution
inferred← citeshttps://doi.org/10.1006/jcss.1997.1559openalex-snapshot
Learning with Unreliable Boundary Queries
inferred← citeshttps://doi.org/10.1006/jcss.2000.1723openalex-snapshot
Agnostic Learning of Geometric Patterns
inferred← citeshttps://doi.org/10.1006/jcss.2001.1794openalex-snapshot
A New Abstract Combinatorial Dimension for Exact Learning via Queries
inferred← citeshttps://doi.org/10.1007/11563983_10openalex-snapshot
Assisting Scientific Discovery with an Adaptive Problem Solver
inferred← citeshttps://doi.org/10.1007/11780496_23openalex-snapshot
Learning Stochastic Logical Automaton
inferred← citeshttps://doi.org/10.1007/11872436_29openalex-snapshot
Query-Based Learning of XPath Expressions
inferred← citeshttps://doi.org/10.1007/3-540-36169-3_13openalex-snapshot
A General Dimension for Approximately Learning Boolean Functions
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_23openalex-snapshot
A General Dimension for Exact Learning
inferred← citeshttps://doi.org/10.1007/3-540-44581-1_38openalex-snapshot
Learning Regular Sets with an Incomplete Membership Oracle
inferred← citeshttps://doi.org/10.1007/3-540-45841-7_31openalex-snapshot
How Many Missing Answers Can Be Tolerated by Query Learners?
inferred← citeshttps://doi.org/10.1007/3-540-46769-6_24openalex-snapshot
Learning Minimal Covers of Functional Dependencies with Queries
inferred← citeshttps://doi.org/10.1007/3-540-46769-6_7openalex-snapshot
The Consistency Dimension and Distribution-Dependent Learning from Queries (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/3-540-49097-3_7openalex-snapshot
Learning Multiplicity Automata from Smallest Counterexamples
inferred← citeshttps://doi.org/10.1007/3-540-49097-3_8openalex-snapshot
Exact Learning when Irrelevant Variables Abound
inferred← citeshttps://doi.org/10.1007/3-540-49292-5_8openalex-snapshot
Uniform Characterizations of Polynomial-Query Learnabilities
inferred← citeshttps://doi.org/10.1007/3-540-51734-0_50openalex-snapshot
Inductive inference, DFAs, and computational complexity
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_53openalex-snapshot
A survey of some aspects of computational learning theory
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_8openalex-snapshot
On the complexity of small description and related topics
inferred← citeshttps://doi.org/10.1007/3-540-57369-0_27openalex-snapshot
A note on the query complexity of learning DFA
inferred← citeshttps://doi.org/10.1007/3-540-57370-4_58openalex-snapshot
The VC-dimensions of finite automata with n states
inferred← citeshttps://doi.org/10.1007/3-540-57811-0_6openalex-snapshot
Learning behaviors of automata from multiplicity and equivalence queries
inferred← citeshttps://doi.org/10.1007/3-540-58131-6_36openalex-snapshot
Learning picture sets from examples
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_193openalex-snapshot
Learning behaviors of automata from shortest counterexamples
inferred← citeshttps://doi.org/10.1007/3-540-59119-2_195openalex-snapshot
The query complexity of learning some subclasses of context-free grammars
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_41openalex-snapshot
Learning ordered binary decision diagrams
inferred← citeshttps://doi.org/10.1007/3-540-60454-5_43openalex-snapshot
The complexity of learning minor closed graph classes
inferred← citeshttps://doi.org/10.1007/3-540-61422-2_125openalex-snapshot
On the hardness of approximating the minimum consistent OBDD problem
inferred← citeshttps://doi.org/10.1007/3-540-61863-5_38openalex-snapshot
The complexity of exactly learning algebraic concepts
inferred← citeshttps://doi.org/10.1007/3-540-62685-9_3openalex-snapshot
Learning monotone term decision lists
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_49openalex-snapshot
Oracles in Σ2p are sufficient for exact learning
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_50openalex-snapshot
Exact learning via teaching assistants (Extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-63890-3_31openalex-snapshot
The complexity of learning branches and strategies from queries
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_2openalex-snapshot
Algorithms for Learning Finite Automata from Queries: A Unified View
inferred← citeshttps://doi.org/10.1007/978-1-84628-172-3_8openalex-snapshot
Data Complexity Issues in Grammatical Inference
inferred← citeshttps://doi.org/10.1007/978-3-030-50423-6_4openalex-snapshot
Grammatical Inference by Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-57628-8_9openalex-snapshot
Active Learning of Timed Automata with Unobservable Resets
inferred← citeshttps://doi.org/10.1007/978-3-031-23612-9_10openalex-snapshot
A Myhill-Nerode Theorem for Finite State Matrix Automata and Finite Matrix Languages
inferred← citeshttps://doi.org/10.1007/978-3-031-71177-0_4openalex-snapshot
DFAMiner: Mining Minimal Separating DFAs from Labelled Samples
inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_5openalex-snapshot
ICE: A Robust Framework for Learning Invariants
inferred← citeshttps://doi.org/10.1007/978-3-319-23437-3_54openalex-snapshot
Grammatical Inference in the Discovery of Generating Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-24486-0_5openalex-snapshot
Exact Learning of Multivalued Dependencies
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_14openalex-snapshot
Model Learning as a Satisfiability Modulo Theories Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-34954-9_6openalex-snapshot
A Survey of Probabilistic Model Building Genetic Programming
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-75225-7_23openalex-snapshot
Polynomial Time Algorithms for Learning k-Reversible Languages and Pattern Languages with Correction Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_26openalex-snapshot
Query Learning and Certificates in Lattices
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_17openalex-snapshot
A Note on the Relationship between Different Types of Correction Queries
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_21openalex-snapshot
Identification in the Limit of k,l-Substitutable Context-Free Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_4openalex-snapshot
Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_3openalex-snapshot
Learning Minimal Separating DFA’s for Compositional Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-04394-9_25openalex-snapshot
Learning from a Smarter Teacher
inferred← citeshttps://doi.org/10.1007/978-3-642-14125-6_13openalex-snapshot
Learning Ordinal Preferences on Multiattribute Domains: The Case of CP-nets
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-15488-1_28openalex-snapshot
Generalizing over Several Learning Settings
inferred← citeshttps://doi.org/10.1007/978-3-642-15488-1_4openalex-snapshot
Distributional Learning of Some Context-Free Languages with a Minimally Adequate Teacher
inferred← citeshttps://doi.org/10.1007/978-3-642-18098-9_29openalex-snapshot
Types of Trusted Information That Make DFA Identification with Correction Queries Feasible
inferred← citeshttps://doi.org/10.1007/978-3-642-34026-0_39openalex-snapshot
Learning Minimal Deterministic Automata from Inexperienced Teachers
inferred← citeshttps://doi.org/10.1007/978-3-662-48395-4_3openalex-snapshot
Learning Grammars and Automata with Queries
inferred← citeshttps://doi.org/10.1007/978-3-662-48395-4_4openalex-snapshot
On the Inference of Finite State Automata from Positive and Negative Data
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/bf00992675openalex-snapshot
Learning conjunctions of Horn clauses
inferred← citeshttps://doi.org/10.1007/bf00992862openalex-snapshot
Learning Probabilistic Automata and Markov Chains via Queries
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/bf01007463openalex-snapshot
On Polynomial-Time Learnability in the Limit of Strictly Deterministic Automata
inferred← citeshttps://doi.org/10.1007/bf01578844openalex-snapshot
Structural analysis of polynomial-time query learnability
inferred← citeshttps://doi.org/10.1007/bf03037351openalex-snapshot
The query complexity of learning DFA
inferred← citeshttps://doi.org/10.1007/bfb0033343openalex-snapshot
Query learning of subsequential transducers
inferred← citeshttps://doi.org/10.1007/pl00001593openalex-snapshot
Complexity theoretic hardness results for query learning
inferred← citeshttps://doi.org/10.1007/s00224-003-1107-5openalex-snapshot
How Many Missing Answers Can Be Tolerated by Query Learners?
inferred← citeshttps://doi.org/10.1007/s00224-015-9659-8openalex-snapshot
Learning Sets of Antecedent-restricted Functional and Multivalued Dependencies with Queries
inferred← citeshttps://doi.org/10.1007/s00354-015-0204-8openalex-snapshot
Learning with Queries inside the Class of Unate k-quasi-Horn Formulas
inferred← citeshttps://doi.org/10.1007/s00354-015-0301-8openalex-snapshot
Learning an Extension of the Class of Functional Dependencies with Queries
inferred← citeshttps://doi.org/10.1007/s10009-026-00839-zopenalex-snapshot
A research agenda for active automata learning
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/0022-0000(91)90016-xopenalex-snapshot
Learning regular languages from counterexamples
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90367-oopenalex-snapshot
On the necessity of Occam algorithms
inferred← citeshttps://doi.org/10.1016/b978-1-55860-146-8.50033-3openalex-snapshot
Learning Conjunctions of Horn Clauses**An extended abstract of this paper appears in Proceedings of the 31st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, 1990.
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/b978-1-55860-213-7.50019-5openalex-snapshot
On-line Learning with an Oblivious Environment and the Power of Randomization
inferred← citeshttps://doi.org/10.1016/b978-1-55860-213-7.50023-7openalex-snapshot
Polynomial-Time Learning of Very Simple Grammars from Positive Data
inferred← citeshttps://doi.org/10.1016/j.artint.2004.01.002openalex-snapshot
Theory revision with queries: Horn, read-once, and parity formulas
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.019openalex-snapshot
Learning conditional preference networks
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.109026openalex-snapshot
Learning Horn envelopes via queries from language models
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.03.008openalex-snapshot
Learning a subclass of k-quasi-Horn formulas with membership queries
inferred← citeshttps://doi.org/10.1016/j.jcss.2004.10.002openalex-snapshot
Exploring learnability between exact and PAC
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.03.003openalex-snapshot
A general dimension for query learning
inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.03.002openalex-snapshot
Inferring regular languages and ω -languages
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.scico.2014.05.008openalex-snapshot
A survey of grammatical inference in software engineering
inferred← citeshttps://doi.org/10.1016/j.scico.2026.103506openalex-snapshot
DFAMiner: An efficient tool for learning minimal separating DFAs from labelled samples
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.01.011openalex-snapshot
On learning multivalued dependencies with queries
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.01.003openalex-snapshot
Four one-shot learners for regular tree languages and their polynomial characterizability
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.018openalex-snapshot
Exact learning of multivalued dependency formulas
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.11.009openalex-snapshot
The power of random counterexamples
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00225-8openalex-snapshot
Almost all monotone Boolean functions are polynomially learnable using membership queries
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00090-8openalex-snapshot
Learning nearly monotone k-term DNF
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00025-xopenalex-snapshot
VC-dimensions of finite automata and commutative finite automata with k letters and n states
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00050-9openalex-snapshot
VC-dimensions of finite automata and commutative finite automata with k letters and n states
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00043-8openalex-snapshot
Monotone term decision lists
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00313-9openalex-snapshot
Even linear simple matrix languages: formal language properties and grammatical inference
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00400-5openalex-snapshot
The consistency dimension and distribution-dependent learning from queries
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00177-9openalex-snapshot
Uniform characterizations of polynomial-query learnabilities
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00423-1openalex-snapshot
Polynomial-time identification of very simple grammars from positive data
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00014-5openalex-snapshot
Recent advances of grammatical inference
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00266-2openalex-snapshot
Exact learning via teaching assistants
inferred← citeshttps://doi.org/10.1016/s0747-7171(06)80013-1openalex-snapshot
Synthesis of real time acceptors
inferred← citeshttps://doi.org/10.1023/a:1007348927491openalex-snapshot
Exactly Learning Automata of Small Cover Time
inferred← citeshttps://doi.org/10.1023/a:1022689015665openalex-snapshot
Learning Conjunctions of Horn Clauses
inferred← citeshttps://doi.org/10.1023/a:1026455409889openalex-snapshot
On the Limits of Proper Learnability of Subclasses of DNF Formulas
inferred← citeshttps://doi.org/10.1089/big.2022.0158openalex-snapshot
IDLIQ: An Incremental Deterministic Finite Automaton Learning Algorithm Through Inverse Queries for Regular Grammar Inference
inferred← citeshttps://doi.org/10.1093/oxfordhb/9780199601264.013.27openalex-snapshot
Computational Theories of Learning and Developmental Psycholinguistics
inferred← citeshttps://doi.org/10.1109/access.2023.3242124openalex-snapshot
A Reinforcement Learning Based Grammatical Inference Algorithm Using Block-Based Delta Inverse Strategy
inferred← citeshttps://doi.org/10.1109/ccc.1999.766279openalex-snapshot
Learning DNF by approximating inclusion-exclusion formulae
inferred← citeshttps://doi.org/10.1109/fscs.1990.89537openalex-snapshot
Learning conjunctions of Horn clauses
inferred← citeshttps://doi.org/10.1109/fuzzy.2006.1681964openalex-snapshot
Alignment Based Similarity Measure for Grammar Learning
inferred← citeshttps://doi.org/10.1109/sct.1994.315791openalex-snapshot
The complexity of learning with queries
inferred← citeshttps://doi.org/10.1109/sfcs.1989.63489openalex-snapshot
The equivalence and learning of probabilistic automata
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/sfcs.1994.365706openalex-snapshot
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
inferred← citeshttps://doi.org/10.1109/spw.2016.26openalex-snapshot
Grammatical Inference and Machine Learning Approaches to Post-Hoc LangSec
inferred← citeshttps://doi.org/10.1137/s009753979326091xopenalex-snapshot
Learning Behaviors of Automata from Multiplicity and Equivalence Queries
inferred← citeshttps://doi.org/10.1137/s0097539794274398openalex-snapshot
On Learning Read-k-Satisfy-j DNF
inferred← citeshttps://doi.org/10.1137/s0895480198340943openalex-snapshot
Learning Deterministic Finite Automata from Smallest Counterexamples
inferred← citeshttps://doi.org/10.1142/s012905410000034xopenalex-snapshot
ORACLES IN $\Sigma^p_2$ ARE SUFFFICIENT FOR EXACT LEARNING
inferred← citeshttps://doi.org/10.1145/100216.100223openalex-snapshot
On the necessity of Occam algorithms
inferred← citeshttps://doi.org/10.1145/130385.130394openalex-snapshot
Learning k -term DNF formulas with an incomplete membership oracle
inferred← citeshttps://doi.org/10.1145/130385.130421openalex-snapshot
A computational model of teaching
inferred← citeshttps://doi.org/10.1145/138027.138042openalex-snapshot
The minimum consistent DFA problem cannot be approximated within any polynomial
inferred← citeshttps://doi.org/10.1145/138027.138061openalex-snapshot
Learning read-once formulas with queries
inferred← citeshttps://doi.org/10.1145/168304.168308openalex-snapshot
Learning μ-branching programs with queries
inferred← citeshttps://doi.org/10.1145/168304.168310openalex-snapshot
Asking questions to minimize errors
inferred← citeshttps://doi.org/10.1145/168304.168311openalex-snapshot
Parameterized learning complexity
inferred← citeshttps://doi.org/10.1145/168304.168312openalex-snapshot
On the query complexity of learning
inferred← citeshttps://doi.org/10.1145/180139.181063openalex-snapshot
On the limits of proper learnability of subclasses of DNF formulas
inferred← citeshttps://doi.org/10.1145/180139.181067openalex-snapshot
Oracles and queries that are sufficient for exact learning (extended abstract)
inferred← citeshttps://doi.org/10.1145/180139.181170openalex-snapshot
Learning from a consistently ignorant teacher
inferred← citeshttps://doi.org/10.1145/225058.225114openalex-snapshot
How many queries are needed to learn?
inferred← citeshttps://doi.org/10.1145/225298.225310openalex-snapshot
Learning with unreliable boundary queries
inferred← citeshttps://doi.org/10.1145/225298.225311openalex-snapshot
Generalized teaching dimensions and the query complexity of learning
inferred← citeshttps://doi.org/10.1145/225298.225350openalex-snapshot
Exactly learning automata with small cover time
inferred← citeshttps://doi.org/10.1145/234752.234755openalex-snapshot
How many queries are needed to learn?
inferred← citeshttps://doi.org/10.1145/238061.238153openalex-snapshot
A competitive approach to game learning
inferred← citeshttps://doi.org/10.1145/238061.238164openalex-snapshot
Learning of depth two neural networks with constant fan-in at the hidden nodes (extended abstract)
inferred← citeshttps://doi.org/10.1145/2448496.2448525openalex-snapshot
Certain and possible XPath answers
inferred← citeshttps://doi.org/10.1145/279943.279980openalex-snapshot
Exact learning of tree patterns from queries and counterexamples
inferred← citeshttps://doi.org/10.1145/279943.280000openalex-snapshot
The query complexity of finding local minima in the lattice
inferred← citeshttps://doi.org/10.1145/2890492openalex-snapshot
The Complexity of Learning Tree Patterns from Example Graphs
inferred← citeshttps://doi.org/10.1145/3034786.3056112openalex-snapshot
Reverse Engineering SPJ-Queries from Examples
inferred← citeshttps://doi.org/10.1145/3196959.3196974openalex-snapshot
Active Learning of GAV Schema Mappings
inferred← citeshttps://doi.org/10.1145/3371073openalex-snapshot
Complexity and information in invariant 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.1145/504192.504194openalex-snapshot
SIGACT News complexity theory column 32
inferred← citeshttps://doi.org/10.1145/73007.73048openalex-snapshot
The minimum consistent DFA problem cannot be approximated within and polynomial
inferred← citeshttps://doi.org/10.1201/9781584888239-c26openalex-snapshot
Computational Learning Theory
inferred← citeshttps://doi.org/10.13053/cys-24-2-3404openalex-snapshot
Grammatical Inference of Semantic Components in Dialogues
inferred← citeshttps://doi.org/10.1609/aaai.v35i10.17107openalex-snapshot
Learning of Structurally Unambiguous Probabilistic Grammars
inferred← citeshttps://doi.org/10.23638/lmcs-15(3:21)2019openalex-snapshot
Query learning of derived $\omega$-tree languages in polynomial time
inferred← citeshttps://doi.org/10.25100/iyc.v11i1.2468openalex-snapshot
Comparación de dos algoritmos recientes para inferencia gramatical de lenguajes regulares mediante autómatas no deterministas
inferred← citeshttps://doi.org/10.3233/jifs-179876openalex-snapshot
Automatic Generation of Dialogues based on Grammatical Inference and the use of a Knowledge Base
inferred← citeshttps://doi.org/10.32657/10356/13589openalex-snapshot
Refining learning models in grammatical inference
inferred← citeshttps://doi.org/10.3390/e25040547openalex-snapshot
Applications of Depth Minimization of Decision Trees Containing Hypotheses for Multiple-Value Decision Tables
inferred← citeshttps://doi.org/10.4230/lipics.icdt.2015.127openalex-snapshot
Learning Tree Patterns from Example Graphs
inferred← citeshttps://doi.org/10.46298/lmcs-19(1:10)2023openalex-snapshot
Learning of Structurally Unambiguous Probabilistic Grammars
inferred← citeshttps://doi.org/10.46298/lmcs-19(2:5)2023openalex-snapshot
Inferring Symbolic Automata
inferred← citeshttps://doi.org/10.48550/arxiv.1207.0052openalex-snapshot
The Complexity of Learning Principles and Parameters Grammars
inferred← citeshttps://doi.org/10.48550/arxiv.1708.08081openalex-snapshot
Learning MSO-definable hypotheses on string
inferred← citeshttps://doi.org/10.48550/arxiv.1709.07314openalex-snapshot
Exact Learning of Lightweight Description Logic Ontologies
inferred← citeshttps://doi.org/10.48550/arxiv.2102.01646openalex-snapshot
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games
inferred← citeshttps://doi.org/10.48550/arxiv.2104.09669openalex-snapshot
Inferring Drop-in Binary Parsers from Program Executions
inferred← citeshttps://doi.org/10.4995/thesis/10251/1957openalex-snapshot
Estudio de la mezcla de estados determinista y no determinista en el diseño de algoritmos para inferencia gramatical de lenguajes regulares.
inferred← citeshttps://doi.org/10.5555/114836.114849openalex-snapshot
Learning monotone DNF with an incomplete membership oracle
inferred← citeshttps://doi.org/10.5555/114836.114852openalex-snapshot
On-line learning with an oblivious environment and the power of randomization
inferred← citeshttps://doi.org/10.5555/114836.114856openalex-snapshot
Polynomial-time learning of very simple grammars from positive data
inferred← citeshttps://doi.org/10.5555/314613.315024openalex-snapshot
Learning deterministic finite automata from smallest counterexamples
inferred← citeshttps://doi.org/10.5555/93335.93351openalex-snapshot
Equivalence queries and approximate fingerprints
inferred← citeshttps://doi.org/10.70675/4f17275bz3ec3z47a3z994czb085928be0e7openalex-snapshot
Analyse et optimisation d'algorithmes pour l'inférence de modèles de composants logiciels
inferred← citeshttps://doi.org/10.7551/mitpress/1120.003.0059openalex-snapshot
Efficiency versus Convergence of Boolean Kernels for On-Line Learning Algorithms
showing the first 197 of 198 · page through all 198
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.