Results 1 
4 of
4
State complexity of basic operations on nondeterministic finite automata
 In Implementation and Application of Automata: 7th International Conference, CIAA 2002 (2003), J.M. Champarnaud and D. Maurel, Eds
"... ..."
(Show Context)
On the Determinization of Weighted Finite Automata
 SIAM J. Comput
, 1998
"... . We study determinization of weighted finitestate automata (WFAs), which has important applications in automatic speech recognition (ASR). We provide the first polynomialtime algorithm to test for the twins property, which determines if a WFA admits a deterministic equivalent. We also provide ..."
Abstract

Cited by 18 (0 self)
 Add to MetaCart
. We study determinization of weighted finitestate automata (WFAs), which has important applications in automatic speech recognition (ASR). We provide the first polynomialtime algorithm to test for the twins property, which determines if a WFA admits a deterministic equivalent. We also provide a rigorous analysis of a determinization algorithm of Mohri, with tight bounds for acyclic WFAs. Given that WFAs can expand exponentially when determinized, we explore why those used in ASR tend to shrink. The folklore explanation is that ASR WFAs have an acyclic, multipartite structure. We show, however, that there exist such WFAs that always incur exponential expansion when determinized. We then introduce a class of WFAs, also with this structure, whose expansion depends on the weights: some weightings cause them to shrink, while others, including random weightings, cause them to expand exponentially. We provide experimental evidence that ASR WFAs exhibit this weight dependence. ...
The Topological Approach to the Limitedness Problem on Distance Automata
, 1998
"... this paper, we present the topological approach to the limitedness problem on distance automata. Our techniques has been improved so that the Brown's result is no longer needed. The main mathematical tools used are the local structure theory for nite semigroup [13] and some basic topological i ..."
Abstract

Cited by 8 (1 self)
 Add to MetaCart
this paper, we present the topological approach to the limitedness problem on distance automata. Our techniques has been improved so that the Brown's result is no longer needed. The main mathematical tools used are the local structure theory for nite semigroup [13] and some basic topological ideas. Most of the technical results in this paper except Lemma 3.9 and Lemma 3.10 were obtained in ([14], [15]). Besides for the sake of completeness, we include all the proofs because many of them have been reworked for better presentations
Refining Nondeterminism Below LinearTime
, 2001
"... Multitape Turing machines with a restricted number of nondeterministic steps are investigated. Fischer and Kintala showed an in nite nondeterministic hierarchy of properly included realtime languages between the deterministic languages and the logbounded nondeterministic languages. This result ..."
Abstract
 Add to MetaCart
(Show Context)
Multitape Turing machines with a restricted number of nondeterministic steps are investigated. Fischer and Kintala showed an in nite nondeterministic hierarchy of properly included realtime languages between the deterministic languages and the logbounded nondeterministic languages. This result is extended to time complexities in the range between realtime and lineartime, and is generalized to arbitrary dimensions.