On Computability and Learnability of the Pumping Lemma Function

DOI10.1007/978-3-319-04921-2_35zbMath1407.68260OpenAlexW2284839299MaRDI QIDQ5404933

Dariusz Kalociński

Publication date: 31 March 2014

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04921-2_35

zbMATH Keywords

reducibilitycomputabilityarithmetical hierarchypumping lemmaalgorithmic learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Recursive functions and relations, subrecursive hierarchies (03D20)

This page was built for publication: On Computability and Learnability of the Pumping Lemma Function