Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
463
The Nondeterministic Complexity of a Finite Automaton
, 1990
"... We define the nondeterministic complexity of a finite automaton and show that there exist, for any integer p>=1, automata which need \Theta(k^{1/p}) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable M-subsets of a free monoid into a ..."
Abstract
-
Cited by 28 (2 self)
- Add to MetaCart
We define the nondeterministic complexity of a finite automaton and show that there exist, for any integer p>=1, automata which need \Theta(k^{1/p}) nondeterministic transitions to spell words of length k. This leads to a subdivision of the family of recognizable M-subsets of a free monoid
Nondeterministic controllers of nondeterministic processes
- Logic and Automata, volume 2 of Texts in Logic and Games
, 2007
"... The controller synthesis problem as formalized by Ramadge and Wonham consists of finding a finite controller that when synchronized with a given plant results in a system satisfying a required property. In this setting, both a plant and a controller are deterministic fi-nite automata, while synchron ..."
Abstract
-
Cited by 9 (1 self)
- Add to MetaCart
of the whole system. In this paper, an extension of the setting to nondeterministic pro-cesses is studied. In other words, the case when both a system and a controller can be presented by a nondeterministic automaton. This extension is motivated by examples in control where a continuous quantity is measured
On Complementing Nondeterministic Büchi Automata
, 2003
"... Several optimal algorithms have been proposed for the complementation of nondeterministic B uchi word automata. Due to the intricacy of the problem and the exponential blow-up that complementation involves, these algorithms have never been used in practice, even though an effective complementatio ..."
Abstract
-
Cited by 26 (8 self)
- Add to MetaCart
approach is based on optimizations of both the intermediate weak alternating automaton and the final nondeterministic automaton, and involves techniques of rank and height reductions, as well as direct and fair simulation.
From nondeterministic suffix automaton to lazy suffix tree
"... Given two strings, a pattern P of length m and a text T of length n over some alphabet Σ of size σ, we consider the exact string matching problem, i.e. we want to report all occurrences of P in T. The well-known Backward-Nondeterministic-DAWG-Matching (BNDM) algorithm is one of the most efficient ..."
Abstract
- Add to MetaCart
algorithm for short to moderate length patterns. In this paper – as a prelude – we take the underlying nondeterministic suffix automaton and apply it to the text instead of to the pattern. The resulting algorithm is surprisingly simple, and efficient for relatively short patterns and small alphabet sizes
Deciding Nondeterministic Hierarchy of Deterministic Tree Automata
- WOLLIC 2004 PRELIMINARY VERSION
, 2004
"... We show an algorithm which, for a given deterministic parity automaton on infinite trees, computes the minimal Mostowski (or Rabin) index of a nondeterministic automaton recognizing the same language. This extends a previous result of Urba'nski on deciding if a given deterministic Rabin automa ..."
Abstract
-
Cited by 13 (1 self)
- Add to MetaCart
We show an algorithm which, for a given deterministic parity automaton on infinite trees, computes the minimal Mostowski (or Rabin) index of a nondeterministic automaton recognizing the same language. This extends a previous result of Urba'nski on deciding if a given deterministic Rabin
Nondeterministic State Complexity of Positional Addition
"... Consider nondeterministic finite automata recognizing base-k positional notation of numbers. Assume that numbers are read starting from their least significant digits. It is proved that if two sets of numbers S and T are represented by nondeterministic automata of m and n states, respectively, then ..."
Abstract
- Add to MetaCart
, then their sum {s + t | s ∈ S, t ∈ T} is represented by a nondeterministic automaton with 2mn+2m+2n+1 states. Moreover, this number of states is necessary in the worst case for all k � 9. 1
An Improved Construction of Deterministic Omega-automaton using Derivatives
"... Abstract. In an earlier paper, the author used derivatives to construct a deterministic automaton recognizing the language defined by an ω-regular expression. The construction was related to a determinization method invented by Safra. This paper describes a new construction, inspired by Piterman&ap ..."
Abstract
- Add to MetaCart
's improvement to Safra's method. It produces an automaton with fewer states. In addition, the presentation and proofs are simplified by going via a nondeterministic automaton having derivatives as states.
A regular expression matching using nondeterministic finite automaton,” MEMOCODE’10,
, 2010
"... Abstract-This paper shows an implementation of CAN-SCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the packet assembler and the regular expression matching are implemented by the dedicated hardware. On the other hand, the co ..."
Abstract
-
Cited by 2 (2 self)
- Add to MetaCart
, the counting of matching results and the system control are implemented by a microprocessor. A regular expression matching circuit is performed as follows: First, the given regular expressions are converted into a non-deterministic finite automaton (NFA). Then, to reduce the number of states, the NFA
Polynomial-Time Verification of Diagnosability of Partially-Observed Discrete-Event Systems
- ACCEPTED FOR PUBLICATION IN TRANSACTIONS OF AUTOMATIC CONTROL
, 2002
"... The problem of verifying the properties of diagnosability and I-diagnosability is considered. We present new polynomial-time algorithms for deciding diagnosability and I-diagnosability. These algorithms are based on the construction of a nondeterministic automaton called a verifier. ..."
Abstract
-
Cited by 66 (5 self)
- Add to MetaCart
The problem of verifying the properties of diagnosability and I-diagnosability is considered. We present new polynomial-time algorithms for deciding diagnosability and I-diagnosability. These algorithms are based on the construction of a nondeterministic automaton called a verifier.
Size of nondeterministic and deterministic automata for certain languages
"... Abstract. In the theory of automata the question about difference between the size of deterministic and nondeterministic automata which recognize the same language is of great importance. However, this problem has been studied mainly in case when input alphabet consists of at least 2 letters. In thi ..."
Abstract
- Add to MetaCart
. In this paper some special kind of languages in one letter alphabet will be discussed and the estimate of the number of states required for deterministic and nondeterministic automata to accept these languages will be made. For one of these languages nondeterministic automaton with ≤ ⎡ n ⎤ + 1 states can
Results 1 - 10
of
463
