Automata techniques for query inference machines

DOI10.1016/S0168-0072(01)00115-4zbMath1013.03009OpenAlexW2085222986MaRDI QIDQ1849855

William I. Gasarch, Geoffrey R. Hird

Publication date: 2 December 2002

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0168-0072(01)00115-4

zbMATH Keywords

query languagedecidabilityTuring machineBüchi automatainductive inferencecomputable setfirst-order monadic predicate logicquery inference machinesecond-order monadic predicate logic

Mathematics Subject Classification ID

Computational learning theory (68Q32) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Turing machines and related notions (03D10)

Related Items (1)

Learning via finitely many queries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparison of identification criteria for machine inductive inference
• Inferring answers to queries
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Learning via queries and oracles
• Trade-off among parameters affecting inductive inference
• Weak Second‐Order Arithmetic and Finite Automata
• Aggregating inductive expertise
• ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
• The Power of Pluralism for Automatic Program Synthesis
• Learning via queries in [+, <]
• Learning via queries
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• Testing and generating infinite sequences by a finite automaton

This page was built for publication: Automata techniques for query inference machines