On the public citation graph

Query learning of subsequential transducers

https://doi.org/10.1007/bfb0033343
0 signed · 28 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/978-3-663-09367-1openalex-snapshot
Transductions and Context-Free Languages
inferredcites →https://doi.org/10.1007/bf00116034openalex-snapshot
Negative Results for Equivalence Queries
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.1109/34.211465openalex-snapshot
Learning subsequential transducers for pattern recognition interpretation tasks
inferredcites →https://doi.org/10.1109/icassp.1995.479286openalex-snapshot
Some results with a trainable speech translation and understanding system
inferredcites →https://doi.org/10.1145/1968.1972openalex-snapshot
A theory of the learnable
inferredcites →https://doi.org/10.1145/3749740.3749746openalex-snapshot
A Theory of the Learnable
inferredcites →https://doi.org/10.3115/981658.981660openalex-snapshot
Automatic induction of finite state transducers for simple phonological rules

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-030-11245-5_3openalex-snapshot
Minimal Synthesis of String to String Functions from Examples
inferred← citeshttps://doi.org/10.1007/978-3-030-45231-5_31openalex-snapshot
Learning Weighted Automata over Principal Ideal Domains
inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_5openalex-snapshot
Active Learning of Sequential Transducers with Side Information About the Domain
inferred← citeshttps://doi.org/10.1007/978-3-032-22730-0_2openalex-snapshot
Learning Bottom-Up Tree Automata Valued in Monoidal Categories
inferred← citeshttps://doi.org/10.1007/978-3-540-88009-7_12openalex-snapshot
Using Multiplicity Automata to Identify Transducer Relations from Membership and Equivalence Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_32openalex-snapshot
libalf: The Automata Learning Framework
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-662-48395-4_3openalex-snapshot
Learning Grammars and Automata with Queries
inferred← citeshttps://doi.org/10.1016/b978-0-12-822116-7.00003-3openalex-snapshot
Applications of grammatical inference methods and future development
inferred← citeshttps://doi.org/10.1016/j.patcog.2005.01.003openalex-snapshot
A bibliographical study of grammatical inference
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00038openalex-snapshot
Learning Weighted Automata over Number Rings, Concretely and Categorically
inferred← citeshttps://doi.org/10.1145/1836089.1836091openalex-snapshot
Dimensions in program synthesis
inferred← citeshttps://doi.org/10.1145/1925844.1926423openalex-snapshot
Automating string processing in spreadsheets using input-output examples
inferred← citeshttps://doi.org/10.1145/2429069.2429123openalex-snapshot
Sigma*
inferred← citeshttps://doi.org/10.2200/s00643ed1v01y201504hlt028openalex-snapshot
Grammatical Inference for Computational Linguistics
inferred← citeshttps://doi.org/10.3233/fi-2016-1394openalex-snapshot
A Canonical Semi-Deterministic Transducer
inferred← citeshttps://doi.org/10.32657/10356/13589openalex-snapshot
Refining learning models in grammatical inference
inferred← citeshttps://doi.org/10.7916/d8-76tr-pr20openalex-snapshot
Symbolic Model Learning: New Algorithms and Applications
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.