30 citations · 67 across the 10 of their papers we have counts for
10 papers · 1 filter
Learning Broadcast Protocols
Dana Fisman, Noa Izsak, Swen Jacobs
The problem of learning a computational model from examples has been receiving growing attention. For the particularly challenging problem of learning models of distributed systems…
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
Dana Angluin, Dana Fisman
A characteristic sample for a language and a learning algorithm is a finite sample of words labeled by their membership in such that for any sample $T \s…
The Normalized Edit Distance with Uniform Operation Costs is a Metric
Dana Fisman, Joshua Grogin, Oded Margalit +1
We prove that the normalized edit distance proposed in [Marzal and Vidal 1993] is a metric when the cost of all the edit operations are the same. This closes a long standing gap in…
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…