On computability and learnability of the pumping lemma function

DOI10.1007/978-3-319-04921-2_35MaRDI QIDQ5404933zbMATH OpenOpenAlexFDO

Authors 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

reducibilitypumping lemmacomputabilityarithmetical hierarchyalgorithmic learning

Mathematics Subject Classification ID

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

Recommendations

• Automatic functions, linear time and learning
• Automatic functions, linear time and learning
• On the amount of nonconstructivity in learning formal languages from text
• On the amount of nonconstructivity in learning formal languages from positive data
• Learning regular sets from queries and counterexamples

Cited in

(2)

• Operational complexity and pumping lemmas
• Pumping, with or without choice

This page was built for publication: On computability and learnability of the pumping lemma function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404933)