27 citations · 28 across the 7 of their papers we have counts for
12 papers · 1 filter
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…
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 sequ…
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…
Multi-dimensional Long-Run Average Problems for Vector Addition Systems with States
Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop
A vector addition system with states (VASS) consists of a finite set of states and counters. A transition changes the current state to the next state, and every counter is either i…
Non-deterministic weighted automata evaluated over Markov chains
Jakub Michaliszyn, Jan Otop
We present the first study of non-deterministic weighted automata under probabilistic semantics. In this semantics words are random events, generated by a Markov chain, and functio…
Approximate Learning of Limit-Average Automata
Jakub Michaliszyn, Jan Otop
Limit-average automata are weighted automata on infinite words that use average to aggregate the weights seen in infinite runs. We study approximate learning problems for limit-ave…