Results 11  20
of
1,074
PAClearnability of Probabilistic Deterministic Finite State Automata
 JOURNAL OF MACHINE LEARNING RESEARCH
, 2004
"... We study the learnability of Probabilistic Deterministic Finite State Automata under a modified PAClearning criterion. We argue that it is necessary to add additional parameters to the sample complexity polynomial, namely a bound on the expected length of strings generated from any state, and a ..."
Abstract

Cited by 35 (8 self)
 Add to MetaCart
We study the learnability of Probabilistic Deterministic Finite State Automata under a modified PAClearning criterion. We argue that it is necessary to add additional parameters to the sample complexity polynomial, namely a bound on the expected length of strings generated from any state, and a
Active coevolutionary learning of deterministic finite automata
 Journal of Machine Learning Research
, 2005
"... This paper describes an active learning approach to the problem of grammatical inference, specifically the inference of deterministic finite automata (DFAs). We refer to the algorithm as the estimationexploration algorithm (EEA). This approach differs from previous passive and active learning appro ..."
Abstract

Cited by 36 (9 self)
 Add to MetaCart
This paper describes an active learning approach to the problem of grammatical inference, specifically the inference of deterministic finite automata (DFAs). We refer to the algorithm as the estimationexploration algorithm (EEA). This approach differs from previous passive and active learning
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
Deterministic Generalized Automata
 THEORETICAL COMPUTER SCIENCE
, 1995
"... A generalized automaton (GA) is a finite automaton where the single transitions are defined on words rather than on single letters. Generalized automata were considered by K. Hashiguchi who proved that the problem of calculating the size of a minimal GA is decidable. We define the model of determin ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
A generalized automaton (GA) is a finite automaton where the single transitions are defined on words rather than on single letters. Generalized automata were considered by K. Hashiguchi who proved that the problem of calculating the size of a minimal GA is decidable. We define the model
Minimisation of deterministic parity and buchi automata and relative minimisation of deterministic finite automata
 CoRR
"... iv ..."
On deterministic finite automata and syntactic monoid size
 PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON DEVELOPMENTS IN LANGUAGE THEORY, NUMBER 2710 IN LNCS
, 2003
"... We investigate the relationship between regular languages and syntactic monoid size. In particular, we consider the transformation monoids of nstate (minimal) deterministic finite automata. We show tight upper bounds on the syntactic monoid size, proving that an nstate deterministic finite automat ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
We investigate the relationship between regular languages and syntactic monoid size. In particular, we consider the transformation monoids of nstate (minimal) deterministic finite automata. We show tight upper bounds on the syntactic monoid size, proving that an nstate deterministic finite
Minimizing Deterministic Lattice Automata
"... Abstract. Traditional automata accept or reject their input, and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The special case of lattice automata, in which the semiring is a finite lattice, has interesting theoretical properties ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
automata is of great interest, both theoretically and in practice. For traditional automata on finite words, a minimization algorithm, based on the MyhillNerode right congruence on the set of words, generates in polynomial time a canonical minimal deterministic automaton. A polynomial algorithm is known
Probabilistic Deterministic Infinite Automata
"... We propose a novel Bayesian nonparametric approach to learning with probabilistic deterministic finite automata (PDFA). We define and develop a sampler for a PDFA with an infinite number of states which we call the probabilistic deterministic infinite automata (PDIA). Posterior predictive inference ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We propose a novel Bayesian nonparametric approach to learning with probabilistic deterministic finite automata (PDFA). We define and develop a sampler for a PDFA with an infinite number of states which we call the probabilistic deterministic infinite automata (PDIA). Posterior predictive inference
Accepted Manuscript Compression of finitestate automata through failure transitions Compression of finitestate automata through failure transitions
, 2014
"... Please cite this article in press as: H. Björklund et al., Compression of finitestate automata through failure transitions, Theor. Comput. Sci. (2014), http://dx.doi.org/10.1016/j.tcs. 2014.09.007 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service ..."
Abstract
 Add to MetaCart
Please cite this article in press as: H. Björklund et al., Compression of finitestate automata through failure transitions, Theor. Comput. Sci. (2014), http://dx.doi.org/10.1016/j.tcs. 2014.09.007 This is a PDF file of an unedited manuscript that has been accepted for publication. As a service
Equivalence of Epsilon, Nondeterministic [Finite] Automata and Deterministic [Finite] Automata
"... YAC Software Summary. Based on concepts introduced in [?], semiautomata and leftlanguages, automata and rightlanguages, and langauges accepted by automata are defined. The powerset construction is defined for transition systems, semiautomata and automata. Finally, the equivalence of epsilon, nond ..."
Abstract
 Add to MetaCart
, nondeterministic [finite] automata and deterministic [finite] automata is shown, respectively.
Results 11  20
of
1,074