30 citations · 111 across the 17 of their papers we have counts for
5 papers · 1 filter
Safety Synthesis Sans Specification
Roderick Bloem, Hana Chockler, Masoud Ebrahimi +2
We define the problem of learning a transducer from a target language containing possibly conflicting transducers, using membership queries and conjecture queries. The re…
Learning of Structurally Unambiguous Probabilistic Grammars
Dolav Nitay, Dana Fisman, Michal Ziv-Ukelson
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estima…
On the Complexity of Symbolic Finite-State Automata
Dana Fisman, Hadar Frenkel, Sandra Zilles
We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the numbe…
Learning Interpretable Models in the Property Specification Language
Rajarshi Roy, Dana Fisman, Daniel Neider
We address the problem of learning human-interpretable descriptions of a complex system from a finite set of positive and negative examples of its behavior. In contrast to most of…
Polynomial time algorithms for inclusion and equivalence of deterministic omega acceptors
Dana Angluin, Dana Fisman
The class of omega languages recognized by deterministic parity acceptors (DPAs) or deterministic Muller acceptors (DMAs) is exactly the regular omega languages. The inclusion prob…