Results 1  10
of
6,158
On the Decomposition of Finite Languages
 Y.S. Han et al. / Intercode Regular Languages
, 1998
"... Representations of finite languages as a product (catenation) of languages are investigated, where the factor languages are "prime", that is, cannot be decomposed further in a nontrivial manner. In general, such prime decompositions are not unique  even the number of factors can vary expo ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
Representations of finite languages as a product (catenation) of languages are investigated, where the factor languages are "prime", that is, cannot be decomposed further in a nontrivial manner. In general, such prime decompositions are not unique  even the number of factors can vary
Bandera: Extracting Finitestate Models from Java Source Code
 IN PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING
, 2000
"... Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a fini ..."
Abstract

Cited by 654 (33 self)
 Add to MetaCart
Finitestate verification techniques, such as model checking, have shown promise as a costeffective means for finding defects in hardware designs. To date, the application of these techniques to software has been hindered by several obstacles. Chief among these is the problem of constructing a
Minimal CoverAutomata for Finite Languages
 Proceedings of the Third International Workshop on Implementing Automata (WIA'98
, 1999
"... A coverautomaton A of a finite language L ` \Sigma is a finite deterministic automaton (DFA) that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic finite cover automaton (DFCA) of a finite language L usually has a smaller size than a min ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
A coverautomaton A of a finite language L ` \Sigma is a finite deterministic automaton (DFA) that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic finite cover automaton (DFCA) of a finite language L usually has a smaller size than a
Estimation of probabilities from sparse data for the language model component of a speech recognizer
 IEEE Transactions on Acoustics, Speech and Signal Processing
, 1987
"... AbstractThe description of a novel type of rngram language model is given. The model offers, via a nonlinear recursive procedure, a computation and space efficient solution to the problem of estimating probabilities from sparse data. This solution compares favorably to other proposed methods. Wh ..."
Abstract

Cited by 799 (2 self)
 Add to MetaCart
AbstractThe description of a novel type of rngram language model is given. The model offers, via a nonlinear recursive procedure, a computation and space efficient solution to the problem of estimating probabilities from sparse data. This solution compares favorably to other proposed methods
Minimal CoverAutomata for Finite Languages
, 1999
"... A coverautomaton A of a finite language L is a nite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic cover automaton of a finite language L usually has a smaller size than a minimal DFA that accept L. Thus, cover automat ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A coverautomaton A of a finite language L is a nite automaton that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic cover automaton of a finite language L usually has a smaller size than a minimal DFA that accept L. Thus, cover
On Well Quasiordering of Finite Languages
"... We investigate here the quasiordering of finite sets of finite strings over an infinite set of symbols S. We set K L iff it is possible to rename symbols occurring in the strings of L so that any string of K is a subsequence of a string of the renamed L. We prove that is a wqo which answers the qu ..."
Abstract
 Add to MetaCart
We investigate here the quasiordering of finite sets of finite strings over an infinite set of symbols S. We set K L iff it is possible to rename symbols occurring in the strings of L so that any string of K is a subsequence of a string of the renamed L. We prove that is a wqo which answers
Cover Automata for Finite Languages
, 2005
"... revision 681 Abstract. Although regular languages combined with nite automata are widely used and studied, many applications only use nite languages. Cover automata were introduced in Câmpeanu et al. (2001) as an ecient way to represent such languages. The bold concept is to have an automaton that ..."
Abstract
 Add to MetaCart
revision 681 Abstract. Although regular languages combined with nite automata are widely used and studied, many applications only use nite languages. Cover automata were introduced in Câmpeanu et al. (2001) as an ecient way to represent such languages. The bold concept is to have an automaton
The faculty of language: what is it, who has it, and how did it evolve?
 Science,
, 2002
"... We argue that an understanding of the faculty of language requires substantial interdisciplinary cooperation. We suggest how current developments in linguistics can be profitably wedded to work in evolutionary biology, anthropology, psychology, and neuroscience. We submit that a distinction should ..."
Abstract

Cited by 472 (7 self)
 Add to MetaCart
be made between the faculty of language in the broad sense (FLB) and in the narrow sense (FLN). FLB includes a sensorymotor system, a conceptualintentional system, and the computational mechanisms for recursion, providing the capacity to generate an infinite range of expressions from a finite set
FiniteState Transducers in Language and Speech Processing
 Computational Linguistics
, 1997
"... Finitestate machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential stringtostring transducer ..."
Abstract

Cited by 392 (42 self)
 Add to MetaCart
Finitestate machines have been used in various domains of natural language processing. We consider here the use of a type of transducers that supports very efficient programs: sequential transducers. We recall classical theorems and give new ones characterizing sequential string
Symbolic Model Checking: 10^20 States and Beyond
, 1992
"... Many different methods have been devised for automatically verifying finite state systems by examining stategraph models of system behavior. These methods all depend on decision procedures that explicitly represent the state space using a list or a table that grows in proportion to the number of st ..."
Abstract

Cited by 758 (41 self)
 Add to MetaCart
, strong and weak observational equivalence of finite transition systems, and language containment for finite wautomata. The fixed point computations for each decision procedure are sometimes complex. but can be concisely expressed in the MuCalculus. We illustrate the practicality of our approach
Results 1  10
of
6,158