3 papers
cs.FL2026
Learning Tree Automata with Term Rewriting
Jakub KopystiaÅski, Jan Otop
We present an extension of the Angluin-style learning algorithm for tree automata that incorporates deductive inference. The learning algorithm is provided with a term rewriting sy…
cs.FL2025
The Target Discounted-Sum Problem
Udi Boker, Thomas A. Henzinger, Jan Otop
The target discounted-sum problem is the following: Given a rational discount factor and three rational values , and , does there exist a finite or an infinite seq…
cs.FL2025
Active Automata Learning with Advice
MichaÅ Fica, Jan Otop
We present an extended automata learning framework that combines active automata learning with deductive inference. The learning algorithm asks membership and equivalence queries a…