Results 11  20
of
463
Nondeterministic NC¹ computation
"... We define the counting classes #NC¹, GapNC¹, PNC¹ and C=NC¹. We prove that boolean circuits, algebraic circuits, programs over nondeterministic finite automata, and programs over constant integer matrices yield equivalent definitions of the latter three classes. We investigate closure properties. We ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
We define the counting classes #NC¹, GapNC¹, PNC¹ and C=NC¹. We prove that boolean circuits, algebraic circuits, programs over nondeterministic finite automata, and programs over constant integer matrices yield equivalent definitions of the latter three classes. We investigate closure properties
MeanPayoff Automaton Expressions
"... Quantitative languages are an extension of boolean languages that assign to each word a real number. Meanpayoff automata are finite automata with numerical weights on transitions that assign to each infinite path the longrun average of the transition weights. When the mode of branching of the aut ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
of the automaton is deterministic, nondeterministic, or alternating, the corresponding class of quantitative languages is not robust as it is not closed under the pointwise operations of max, min, sum, and numerical complement. Nondeterministic and alternating meanpayoff automata are not decidable either
From nondeterministic Büchi and Streett automata to deterministic parity automata
 In 21st Symposium on Logic in Computer Science (LICS’06
, 2006
"... Determinization and complementation are fundamental notions in computer science. When considering finite automata on finite words determinization gives also a solution to complementation. Given a nondeterministic finite automaton there exists an exponential construction that gives a deterministic au ..."
Abstract

Cited by 74 (5 self)
 Add to MetaCart
Determinization and complementation are fundamental notions in computer science. When considering finite automata on finite words determinization gives also a solution to complementation. Given a nondeterministic finite automaton there exists an exponential construction that gives a deterministic
Computing the Prefix of an Automaton
, 2000
"... We present an algorithm for computating the prex of an automaton. Automata considered are nondeterministic, labelled on words, and can have "transitions. The prex automaton of an automaton A has the following properties. It has the same graph as A. Each accepting path has the same label a ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We present an algorithm for computating the prex of an automaton. Automata considered are nondeterministic, labelled on words, and can have "transitions. The prex automaton of an automaton A has the following properties. It has the same graph as A. Each accepting path has the same label
The Factor Automaton 1
"... Abstract. The direct acyclic word graph (DAWG) is a good data structure representing a set of strings related to some word with very small space complexity. The famoust DAWG is the factor DAWG which is representing the set Fac(text) of all factors (substrings) of the string text. Bellow we call fac ..."
Abstract
 Add to MetaCart
are usefull for fast derivating of the DAWG automaton from a similar one. This paper concern operation Ldelete on factor graph DAWG and the relationship between deterministic and nondeterministic factor automaton.
Smart Automaton Implementations
, 304
"... The aim of this report is to present an overview of techniques to optimize memory usage when constructing automata from regular expressions. It is essential to keep a decent time complexity when processing text i.e. better than the classical O(l × n) (With l the length of the text, and n the number ..."
Abstract
 Add to MetaCart
of states) for nondeterministic automata. This document will focus on partial determinization used with the Glushkov algorithm in order to produce lightweight and efficient automata. The NavarroRaffinot and ChamparnaudCoulonParanthoën methods will be studied. Le but de cet exposé est de présenter
Finite nondeterministic automata: simulation and minimality
 Theoret. Comput. Sci
, 1999
"... Motivated by recent applications of finite automata to theoretical physics, we study the minimization problem for nondeterministic automata (with outputs, but no initial states). We use Ehrenfeucht–Fraïsselike games to model automata responses and simulations. The minimal automaton is constructed a ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
Motivated by recent applications of finite automata to theoretical physics, we study the minimization problem for nondeterministic automata (with outputs, but no initial states). We use Ehrenfeucht–Fraïsselike games to model automata responses and simulations. The minimal automaton is constructed
S.: Converting nondeterministic automata and contextfree grammars into Parikh equivalent deterministic automata
 DLT 2012. LNCS
"... Abstract. We investigate the conversion of oneway nondeterministic finite automata and contextfree grammars into Parikh equivalent oneway and twoway deterministic finite automata, from a descriptional complexity point of view. We prove that for each oneway nondeterministic automaton with n stat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We investigate the conversion of oneway nondeterministic finite automata and contextfree grammars into Parikh equivalent oneway and twoway deterministic finite automata, from a descriptional complexity point of view. We prove that for each oneway nondeterministic automaton with n
Random Generation of Nondeterministic Tree Automata
"... Algorithms for (nondeterministic) finitestate tree automata (NTA) are often tested on random NTA, in which all internal transitions are equiprobable. The runtime results obtained in this manner are usually overly optimistic as most such generated random NTA are trivial in the sense that the number ..."
Abstract
 Add to MetaCart
Algorithms for (nondeterministic) finitestate tree automata (NTA) are often tested on random NTA, in which all internal transitions are equiprobable. The runtime results obtained in this manner are usually overly optimistic as most such generated random NTA are trivial in the sense
Fast Regular Expression Matching using FPGAs
, 2001
"... This paper presents an efficient method for finding matches to a given regular expression in given text using FPGAs. To match a regular expression of length n, a serial machine requires O(2 ) memory and takes O(1) time per text character. The proposed approach requires only O(n 2) space and still pr ..."
Abstract

Cited by 191 (16 self)
 Add to MetaCart
processes a text character in O(1) time (one clock cycle). The improvement is due to the Nondeterministic Finite Automaton (NFA) used to perform the matching. As far as the authors are aware, this is the fnst practical use of a nondeterministic state machine on programmable logic.
Results 11  20
of
463