On the public citation graph

Polynomial-time inference of arbitrary pattern languages

0 signed · 132 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-11980-9_19openalex-snapshot

Polynomial time inference of extended regular pattern languages

inferredcites →https://doi.org/10.1007/3-540-51734-0_49openalex-snapshot

Inductive inference from good examples

inferredcites →https://doi.org/10.1007/bf00116828openalex-snapshot

Queries and Concept Learning

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/s0019-9958(67)91165-5openalex-snapshot

Language identification in the limit

inferredcites →https://doi.org/10.1016/s0019-9958(75)90261-2openalex-snapshot

Toward a mathematical theory of inductive inference

inferredcites →https://doi.org/10.1016/s0020-0255(80)80006-5openalex-snapshot

Research in the theory of inductive inference by GDR mathematicians—A survey

inferredcites →https://doi.org/10.1145/356914.356918openalex-snapshot

Inductive Inference: Theory and Methods

inferredcites →https://doi.org/10.5555/93025.93112openalex-snapshot

Learning pattern languages from a single initial example and from queries

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.1995.1107openalex-snapshot

Characterizations of Monotonic and Dual Monotonic Language Learning

inferred← citeshttps://doi.org/10.1006/inco.1998.2784openalex-snapshot

Incremental Concept Learning for Bounded Data Mining

inferred← citeshttps://doi.org/10.1006/jcss.1996.0020openalex-snapshot

Teaching a Smarter Learner

inferred← citeshttps://doi.org/10.1006/jcss.1996.0051openalex-snapshot

Incremental Learning from Positive Data

inferred← citeshttps://doi.org/10.1006/jcss.1997.1491openalex-snapshot

A Model of Interactive Teaching

inferred← citeshttps://doi.org/10.1006/jcss.1999.1669openalex-snapshot

An Average-Case Optimal One-Variable Pattern Language Learner

inferred← citeshttps://doi.org/10.1007/11503415_26openalex-snapshot

Variations on U-Shaped Learning

inferred← citeshttps://doi.org/10.1007/11505877_22openalex-snapshot

Unambiguous Morphic Images of Strings

inferred← citeshttps://doi.org/10.1007/11750321_44openalex-snapshot

Inductive Inference and Language Learning

inferred← citeshttps://doi.org/10.1007/3-540-36169-3_25openalex-snapshot

A Negative Result on Inductive Inference of Extended Pattern Languages

inferred← citeshttps://doi.org/10.1007/3-540-40992-0_7openalex-snapshot

Learning Erasing Pattern Languages with Queries

inferred← citeshttps://doi.org/10.1007/3-540-45322-9_11openalex-snapshot

Stochastic Finite Learning

inferred← citeshttps://doi.org/10.1007/3-540-45790-9_5openalex-snapshot

Consistent Identification in the Limit of Rigid Grammars from Strings Is NP-hard

inferred← citeshttps://doi.org/10.1007/3-540-46769-6_10openalex-snapshot

On the Strength of Incremental Learning

inferred← citeshttps://doi.org/10.1007/3-540-46769-6_29openalex-snapshot

On Learning Unions of Pattern Languages and Tree Patterns

inferred← citeshttps://doi.org/10.1007/3-540-48199-0_8openalex-snapshot

Consistent Identification in the Limit of Any of the Classes k-Valued Is NP-hard

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-56004-1_17openalex-snapshot

A unifying approach to monotonic language learning on informant

inferred← citeshttps://doi.org/10.1007/3-540-56004-1_5openalex-snapshot

Too much information can be too much for learning efficiently

inferred← citeshttps://doi.org/10.1007/3-540-57369-0_24openalex-snapshot

From inductive inference to algorithmic learning theory

inferred← citeshttps://doi.org/10.1007/3-540-57370-4_39openalex-snapshot

Case-based representation and learning of pattern languages

inferred← citeshttps://doi.org/10.1007/3-540-57785-8_178openalex-snapshot

Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data

inferred← citeshttps://doi.org/10.1007/3-540-58520-6_49openalex-snapshot

Average case analysis of pattern language learning algorithms

inferred← citeshttps://doi.org/10.1007/3-540-58520-6_74openalex-snapshot

Finding tree patterns consistent with positive and negative examples using queries

inferred← citeshttps://doi.org/10.1007/3-540-58520-6_81openalex-snapshot

Language learning from good examples

inferred← citeshttps://doi.org/10.1007/3-540-58520-6_83openalex-snapshot

Set-driven and rearrangement-independent learning of recursive languages

inferred← citeshttps://doi.org/10.1007/3-540-59119-2_182openalex-snapshot

MDL learning of unions of simple pattern languages from positive examples

inferred← citeshttps://doi.org/10.1007/3-540-60217-8_1openalex-snapshot

Learning and consistency

inferred← citeshttps://doi.org/10.1007/3-540-60217-8_12openalex-snapshot

A guided tour across the boundaries of learning recursive languages

inferred← citeshttps://doi.org/10.1007/3-540-60217-8_13openalex-snapshot

Pattern inference

inferred← citeshttps://doi.org/10.1007/3-540-60217-8_3openalex-snapshot

Learning from good examples

inferred← citeshttps://doi.org/10.1007/3-540-62064-8_12openalex-snapshot

Co-learning of recursive languages from positive data

inferred← citeshttps://doi.org/10.1007/3-540-62685-9_16openalex-snapshot

learning pattern languages using queries

inferred← citeshttps://doi.org/10.1007/3-540-63577-7_48openalex-snapshot

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

inferred← citeshttps://doi.org/10.1007/978-0-387-30164-8_160openalex-snapshot

Connections Between Inductive Inference and Machine Learning

inferred← citeshttps://doi.org/10.1007/978-0-387-30164-8_787openalex-snapshot

Stochastic Finite Learning

inferred← citeshttps://doi.org/10.1007/978-1-4471-2155-8_35openalex-snapshot

On the Parameterised Complexity of Learning Patterns

inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_52-1openalex-snapshot

Connections Between Inductive Inference and Machine Learning

inferred← citeshttps://doi.org/10.1007/978-1-4899-7502-7_793-1openalex-snapshot

Stochastic Finite Learning

inferred← citeshttps://doi.org/10.1007/978-1-4899-7687-1_52openalex-snapshot

Connections Between Inductive Inference and Machine Learning

inferred← citeshttps://doi.org/10.1007/978-1-4899-7687-1_793openalex-snapshot

Stochastic Finite Learning

inferred← citeshttps://doi.org/10.1007/978-3-031-26876-2_2openalex-snapshot

Interactive Collaborative Learning with Explainable Artificial Intelligence

inferred← citeshttps://doi.org/10.1007/978-3-319-09698-8_25openalex-snapshot

Closure Properties of Pattern Languages

inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_30openalex-snapshot

Steganography Based on Pattern Languages

inferred← citeshttps://doi.org/10.1007/978-3-319-46379-7_13openalex-snapshot

Learning Pattern Languages over Groups

inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_12openalex-snapshot

A Discontinuity in Pattern Inference

inferred← citeshttps://doi.org/10.1007/978-3-540-27819-1_10openalex-snapshot

On the Learnability of E-pattern Languages over Small Alphabets

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/978-3-540-39886-8_18openalex-snapshot

Patterns

inferred← citeshttps://doi.org/10.1007/978-3-540-72927-3_14openalex-snapshot

U-Shaped, Iterative, and Iterative-with-Counter Learning

inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_20openalex-snapshot

Learning Efficiency of Very Simple Grammars from Positive Data

inferred← citeshttps://doi.org/10.1007/978-3-540-75225-7_8openalex-snapshot

Parallelism Increases Iterative Learning Power

inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_30openalex-snapshot

Iterative Learning of Simple External Contextual Languages

inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_10openalex-snapshot

On Learning Regular Expressions and Patterns Via Membership and Correction Queries

inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_27openalex-snapshot

Learnability of Automatic Classes

inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_32openalex-snapshot

String Extension Learning Using Lattices

inferred← citeshttps://doi.org/10.1007/978-3-642-16108-7_25openalex-snapshot

Learning without Coding

inferred← citeshttps://doi.org/10.1007/978-3-642-21254-3_14openalex-snapshot

Automatic Learning of Subclasses of Pattern Languages

inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_24openalex-snapshot

Polynomial-Time Algorithms for Learning Typed Pattern Languages

inferred← citeshttps://doi.org/10.1007/978-3-642-28332-1_40openalex-snapshot

Patterns with Bounded Treewidth

inferred← citeshttps://doi.org/10.1007/978-3-642-31653-1_13openalex-snapshot

Regular and Context-Free Pattern Languages over Small Alphabets

inferred← citeshttps://doi.org/10.1007/978-3-642-38836-1_8openalex-snapshot

Direct Execution Learning Technology

inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_6openalex-snapshot

Inductive Inference of 0L Languages

inferred← citeshttps://doi.org/10.1007/978-3-658-42060-4_13openalex-snapshot

Verständliche Künstliche Intelligenz in Assistenzsystemen an Mensch-System-Schnittstellen

inferred← citeshttps://doi.org/10.1007/978-3-662-48395-4_1openalex-snapshot

Gold-Style Learning Theory

inferred← citeshttps://doi.org/10.1007/bf01301967openalex-snapshot

Set-driven and rearrangement-independent learning of recursive languages

inferred← citeshttps://doi.org/10.1007/bf03037350openalex-snapshot

From inductive inference to algorithmic learning theory

inferred← citeshttps://doi.org/10.1007/bfb0023323openalex-snapshot

A note on polynomial-time inference of k-variable pattern languages

inferred← citeshttps://doi.org/10.1007/bfb0030389openalex-snapshot

A polynomial time algorithm for finding finite unions of tree pattern languages

inferred← citeshttps://doi.org/10.1007/bfb0033340openalex-snapshot

Inductive inference from positive data: from heuristic to characterizing methods

inferred← citeshttps://doi.org/10.1007/bfb0054060openalex-snapshot

Learning k-variable pattern languages efficiently stochastically finite on average from positive data

inferred← citeshttps://doi.org/10.1007/s10994-008-5047-9openalex-snapshot

U-shaped, iterative, and iterative-with-counter learning

inferred← citeshttps://doi.org/10.1007/springerreference_178872openalex-snapshot

Connections Between Inductive Inference and Machine Learning

inferred← citeshttps://doi.org/10.1016/0304-3975(93)90353-uopenalex-snapshot

On the power of inductive inference from good examples

inferred← citeshttps://doi.org/10.1016/0304-3975(95)00284-7openalex-snapshot

Monotonic and dual monotonic language learning

inferred← citeshttps://doi.org/10.1016/0304-3975(95)91134-copenalex-snapshot

Case-based representation and learning of pattern languages

inferred← citeshttps://doi.org/10.1016/j.ic.2006.04.001openalex-snapshot

Variations on U-shaped learning

inferred← citeshttps://doi.org/10.1016/j.ic.2012.07.001openalex-snapshot

Automatic learning of subclasses of pattern languages

inferred← citeshttps://doi.org/10.1016/j.ic.2014.08.010openalex-snapshot

Patterns with bounded treewidth

inferred← citeshttps://doi.org/10.1016/j.ipl.2010.09.010openalex-snapshot

Regular patterns, regular languages and context-free languages

inferred← citeshttps://doi.org/10.1016/j.jcss.2011.12.011openalex-snapshot

Learnability of automatic classes

inferred← citeshttps://doi.org/10.1016/j.jcss.2012.10.001openalex-snapshot

Inferring descriptive generalisations of formal languages

inferred← citeshttps://doi.org/10.1016/j.jcss.2016.07.003openalex-snapshot

Closure properties of pattern languages

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.001openalex-snapshot

Learning erasing pattern languages with queries

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.09.004openalex-snapshot

Inductive inference of approximations for recursive concepts

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.10.017openalex-snapshot

A non-learnable class of E-pattern languages

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.2008.02.028openalex-snapshot

Developments from enquiries into the learnability of the pattern languages from positive data

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.029openalex-snapshot

Discontinuities in pattern inference

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.030openalex-snapshot

Learning indexed families of recursive languages from positive data: A survey

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.012openalex-snapshot

Learning efficiency of very simple grammars from positive data

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.015openalex-snapshot

Parallelism increases iterative learning power

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.04.009openalex-snapshot

Iterative learning of simple external contextual languages

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.017openalex-snapshot

Learning in the limit with lattice-structured hypothesis spaces

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.10.011openalex-snapshot

Learning without coding

inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.035openalex-snapshot

Regular and context-free pattern languages over small alphabets

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.12.031openalex-snapshot

Learning pattern languages over groups

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(00)00136-5openalex-snapshot

Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00402-9openalex-snapshot

On learning unions of pattern languages and tree patterns in the mistake bound model

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00404-2openalex-snapshot

On the power of incremental learning

inferred← citeshttps://doi.org/10.1016/s0747-7171(06)80012-xopenalex-snapshot

Logic program synthesis from incomplete specifications

inferred← citeshttps://doi.org/10.1023/a:1010875913047openalex-snapshot

Stochastic Finite Learning of the Pattern Languages

inferred← citeshttps://doi.org/10.1023/a:1010971904477openalex-snapshot

On Exact Learning of Unordered Tree Patterns

inferred← citeshttps://doi.org/10.1023/a:1018912223866openalex-snapshot

Finding tree patterns consistent with positive and negative examples using queries

inferred← citeshttps://doi.org/10.1023/a:1018955906119openalex-snapshot

Learning recursive languages from good examples

inferred← citeshttps://doi.org/10.1023/a:1018964207937openalex-snapshot

Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time

inferred← citeshttps://doi.org/10.1063/1.2965098openalex-snapshot

Learning Decision Trees over Erasing Pattern Languages

inferred← citeshttps://doi.org/10.1080/09528139408953782openalex-snapshot

Characterization of language learning front informant under various monotonicity constraints

inferred← citeshttps://doi.org/10.1080/09528139408953785openalex-snapshot

Ignoring data may be the only way to learn efficiently

inferred← citeshttps://doi.org/10.1109/gcce.2014.7031297openalex-snapshot

An interactive concierge for independent living

inferred← citeshttps://doi.org/10.1109/spw.2015.17openalex-snapshot

Grammatical Inference and Language Frameworks for LANGSEC

inferred← citeshttps://doi.org/10.1142/9789814360548_0006openalex-snapshot

ON AUTOMATIC FAMILIES

inferred← citeshttps://doi.org/10.1142/s0129054106004017openalex-snapshot

UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

inferred← citeshttps://doi.org/10.1145/130385.130427openalex-snapshot

Types of monotonic language learning and their characterization

inferred← citeshttps://doi.org/10.1145/168304.168313openalex-snapshot

Teaching a smart learner

inferred← citeshttps://doi.org/10.1145/225298.225325openalex-snapshot

DNF---if you can't learn'em, teach'em

inferred← citeshttps://doi.org/10.1145/279943.279955openalex-snapshot

Learnability of a subclass of extended pattern languages

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.279984openalex-snapshot

Learning one-variable pattern languages in linear average time

inferred← citeshttps://doi.org/10.1587/transinf.2019fcp0009openalex-snapshot

An Efficient Learning Algorithm for Regular Pattern Languages Using One Positive Example and a Linear Number of Membership Queries

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.