Search results for "Computer Science::Formal Languages and Automata Theory"
showing 10 items of 228 documents
"Table 7" of "Search for a heavy top-quark partner in final states with two leptons with the ATLAS detector at the LHC"
2012
(1) Observed CLs values for the scalar top signal grid (2) Expected CLs values for the scalar top signal grid.
"Table 60" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…
2013
observed CLs values for the best expected combination in the M(chargino), M(neutralino) plane in the scenario where M(stop) = 180 GEV.
"Table 59" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…
2013
expected CLs values for the best expected combination in the M(chargino), M(neutralino) plane in the scenario where M(stop) = 180 GEV.
"Table 65" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…
2013
expected CLs values for the best expected combination in the M(stop), M(neutralino) plane in the scenario where M(chargino) = 106 GEV.
"Table 66" of "Search for light top squark pair production in final states with leptons and b-jets with the ATLAS detector in sqrt(s) = 7 TeV proton-…
2013
observed CLs values for the best expected combination in the M(stop), M(neutralino) plane in the scenario where M(chargino) = 106 GEV.
Vertical Representation of C∞-words
2015
International audience; We present a new framework for dealing with C∞-words, based on their left and right frontiers. Thisallows us to give a compact representation of them, and to describe the set of C∞-words throughan infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers ofC∞-words. We show that this map can be defined recursively and with no explicit reference toC∞-words. We then show that some important conjectures on C∞-words follow from analogousstatements on the structure of the graph G.
Representation of Autonomous Automata
2001
An autonomous automaton is a finite automaton with output in which the input alphabet has cardinality one when special reduced. We define the transition from automata to semigroups via a representation successful if given two incomparable automata (neither simulate the other), the semigroups representing the automata are distinct. We show that representation by the transition semigroup is not successful. We then consider a representation of automata by semigroups of partial transformations. We show that in general transition from automata to semigroups by this representation is not successful either. In fact, the only successful transition presented is the transiton to this semigroup of par…
Minimal Forbidden Factors of Circular Words
2017
Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al.ÃÂ [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language M, computes a DFA of the language having M as set of minimal forbidden factors. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word. We gener…
Vertical representation of C∞-words
2015
We present a new framework for dealing with C ∞ -words, based on their left and right frontiers. This allows us to give a compact representation of them, and to describe the set of C ∞ -words through an infinite directed acyclic graph G. This graph is defined by a map acting on the frontiers of C ∞ -words. We show that this map can be defined recursively and with no explicit reference to C ∞ -words. We then show that some important conjectures on C ∞ -words follow from analogous statements on the structure of the graph G.
A challenging family of automata for classical minimization algorithms
2010
In this paper a particular family of deterministic automata that was built to reach the worst case complexity of Hopcroft's state minimization algorithm is considered. This family is also challenging for the two other classical minimization algorithms: it achieves the worst case for Moore's algorithm, as a consequence of a result by Berstel et al., and is of at least quadratic complexity for Brzozowski's solution, which is our main contribution. It therefore constitutes an interesting family, which can be useful to measure the efficiency of implementations of well-known or new minimization algorithms.