Learners based on transducers
type: Item
instance of: scholarly article
title: Learners based on transducers
author: Sanjay Jain
author: Shao Ning Kuek
author: Éric Martin
author: Frank Stephan
published in: Information and Computation
publication date: 2022-03-14T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7488449
MaRDI profile type: MaRDI publication profile
full work available at URL: j.ic.2020.104676
OpenAlex ID: W4206628620
cites work: Inductive inference of formal languages from positive data
cites work: Q3859267
cites work: Inductive inference of automata, functions and programs
cites work: Toward a mathematical theory of inductive inference
cites work: Q4736874
cites work: Q3704910
cites work: Automatic Learning of Subclasses of Pattern Languages
cites work: Automatic functions, linear time and learning
cites work: Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
cites work: Strongly non-U-shaped language learning results by general techniques
cites work: Comparison of identification criteria for machine inductive inference
cites work: Multitape one-way nonwriting automata
cites work: On the impact of forgetting on learning machines
cites work: Language identification in the limit
cites work: Q3312199
cites work: Q4506483
cites work: Monotonic and non-monotonic inductive inference
cites work: On the role of update constraints and text-types in iterative learning
cites work: Learners based on transducers
cites work: Learnability of automatic classes
cites work: ON AUTOMATIC FAMILIES
cites work: Inclusion is undecidable for pattern languages
cites work: Three Lectures on Automatic Structures
cites work: Q4850551
cites work: Automata theory and its applications
cites work: Q3396632
cites work: Automatic Structures: Richness and Limitations
cites work: Language learning from texts: Mindchanges, limited memory and monotonicity
cites work: Q3408148
cites work: Learning indexed families of recursive languages from positive data: A survey
cites work: THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
cites work: Transductions des langages de Chomsky
cites work: Classical recursion theory. The theory of functions and sets of natural numbers
cites work: Learning strategies
cites work: Automata Presenting Structures: A Survey of the Finite String Case
cites work: Automatic structures
cites work: A formal theory of inductive inference. Part I
cites work: A formal theory of inductive inference. Part II
cites work: Q4115138
cites work: Q4282560
DOI: 10.1016/J.IC.2020.104676
description: scientific article; zbMATH DE number 7488449