Automatic functions, linear time and learning
From MaRDI portal
Publication:2848364
DOI10.2168/LMCS-9(3:19)2013zbMath1274.68143OpenAlexW3104754573MaRDI QIDQ2848364
Sanjay Jain, John Case, Frank Stephan
Publication date: 26 September 2013
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2168/lmcs-9(3:19)2013
computational complexityinductive inferenceautomatic structureslearning power of resource-bounded learnerslinear time computation
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Finitely Generated Semiautomatic Groups ⋮ Second-order finite automata ⋮ Learning pattern languages over groups ⋮ Lamplighter groups and automata ⋮ A computation model with automatic functions and relations as primitive operations ⋮ Addition machines, automatic functions and open problems of Floyd and Knuth ⋮ String compression in FA-presentable structures ⋮ Automatic learning from positive data and negative counterexamples ⋮ Learners based on transducers ⋮ Cayley polynomial-time computable groups
This page was built for publication: Automatic functions, linear time and learning
