Automata techniques for query inference machines

DOI10.1016/S0168-0072(01)00115-4MaRDI QIDQ1849855zbMATH OpenOpenAlexFDO

Authors William 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

decidabilityinductive inferenceTuring machinequery languagecomputable set[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=B%EF%BF%BD%EF%BF%BDchi+automata&go=Go B��chi automata]first-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)

Recommendations

• Query automata over finite trees
• scientific article; zbMATH DE number 1008506
• scientific article; zbMATH DE number 176242
• Learning grammars and automata with queries
• Learning finite cover automata from queries
• Grammars and automata to optimize chain logic queries
• Automated inferencing
• Inferring Symbolic Automata
• Automata and Answer Set Programming

Cites work

• scientific article; zbMATH DE number 47903 (Why is no real title available?)
• scientific article; zbMATH DE number 1051236 (Why is no real title available?)
• scientific article; zbMATH DE number 762059 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• scientific article; zbMATH DE number 3316928 (Why is no real title available?)
• scientific article; zbMATH DE number 3365234 (Why is no real title available?)
• Aggregating inductive expertise
• Comparison of identification criteria for machine inductive inference
• Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
• Inferring answers to queries
• Learning via queries
• Learning via queries and oracles
• Learning via queries in [+, <]
• ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERS
• Testing and generating infinite sequences by a finite automaton
• The Power of Pluralism for Automatic Program Synthesis
• Theories of automata on \(\omega\)-tapes: a simplified approach
• Trade-off among parameters affecting inductive inference
• Weak Second‐Order Arithmetic and Finite Automata

Cited in

(2)

• Learning via queries in [+, <]
• Learning via finitely many queries

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

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