867 research outputs found
On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs
We tackle the problem of the randomized generation of slowly synchronizing
deterministic automata (DFAs) by generating random primitive sets of matrices.
We show that when the randomized procedure is too simple the exponent of the
generated sets is O(n log n) with high probability, thus the procedure fails to
return DFAs with large reset threshold. We extend this result to random
nondeterministic automata (NDFAs) by showing, in particular, that a uniformly
sampled NDFA has both a 2-directing word and a 3-directing word of length O(n
log n) with high probability. We then present a more involved randomized
algorithm that manages to generate DFAs with large reset threshold and we
finally leverage this finding for exhibiting new families of DFAs with reset
threshold of order .Comment: 31 pages, 9 figures. arXiv admin note: text overlap with
arXiv:1805.0672
Learning Moore Machines from Input-Output Traces
The problem of learning automata from example traces (but no equivalence or
membership queries) is fundamental in automata learning theory and practice. In
this paper we study this problem for finite state machines with inputs and
outputs, and in particular for Moore machines. We develop three algorithms for
solving this problem: (1) the PTAP algorithm, which transforms a set of
input-output traces into an incomplete Moore machine and then completes the
machine with self-loops; (2) the PRPNI algorithm, which uses the well-known
RPNI algorithm for automata learning to learn a product of automata encoding a
Moore machine; and (3) the MooreMI algorithm, which directly learns a Moore
machine using PTAP extended with state merging. We prove that MooreMI has the
fundamental identification in the limit property. We also compare the
algorithms experimentally in terms of the size of the learned machine and
several notions of accuracy, introduced in this paper. Finally, we compare with
OSTIA, an algorithm that learns a more general class of transducers, and find
that OSTIA generally does not learn a Moore machine, even when fed with a
characteristic sample
Testing the Equivalence of Regular Languages
The minimal deterministic finite automaton is generally used to determine
regular languages equality. Antimirov and Mosses proposed a rewrite system for
deciding regular expressions equivalence of which Almeida et al. presented an
improved variant. Hopcroft and Karp proposed an almost linear algorithm for
testing the equivalence of two deterministic finite automata that avoids
minimisation. In this paper we improve the best-case running time, present an
extension of this algorithm to non-deterministic finite automata, and establish
a relationship between this algorithm and the one proposed in Almeida et al. We
also present some experimental comparative results. All these algorithms are
closely related with the recent coalgebraic approach to automata proposed by
Rutten
Propagating Regular Counting Constraints
Constraints over finite sequences of variables are ubiquitous in sequencing
and timetabling. Moreover, the wide variety of such constraints in practical
applications led to general modelling techniques and generic propagation
algorithms, often based on deterministic finite automata (DFA) and their
extensions. We consider counter-DFAs (cDFA), which provide concise models for
regular counting constraints, that is constraints over the number of times a
regular-language pattern occurs in a sequence. We show how to enforce domain
consistency in polynomial time for atmost and atleast regular counting
constraints based on the frequent case of a cDFA with only accepting states and
a single counter that can be incremented by transitions. We also prove that the
satisfaction of exact regular counting constraints is NP-hard and indicate that
an incomplete algorithm for exact regular counting constraints is faster and
provides more pruning than the existing propagator from [3]. Regular counting
constraints are closely related to the CostRegular constraint but contribute
both a natural abstraction and some computational advantages.Comment: Includes a SICStus Prolog source file with the propagato
Strengthening measurements from the edges: application-level packet loss rate estimation
Network users know much less than ISPs, Internet exchanges and content providers about what happens inside the network. Consequently users cannot either easily detect network neutrality violations or readily exercise their market power by knowledgeably switching ISPs. This paper contributes to the ongoing efforts to empower users by proposing two models to estimate -- via application-level measurements -- a key network indicator, i.e., the packet loss rate (PLR) experienced by FTP-like TCP downloads. Controlled, testbed, and large-scale experiments show that the Inverse Mathis model is simpler and more consistent across the whole PLR range, but less accurate than the more advanced Likely Rexmit model for landline connections and moderate PL
- …