Results 1  10
of
651
Distributional Regularity and Phonotactic Constraints are Useful for Segmentation
 Cognition
, 1996
"... In order to acquire a lexicon, young children must segment speech into words, even though most words are unfamiliar to them. This is a nontrivial task because speech lacks any acoustic analog of the blank spaces between printed words. Two sources of information that might be useful for this task ar ..."
Abstract

Cited by 187 (1 self)
 Add to MetaCart
by a class of functions called DR functions. We then put forth three hypotheses: First, that children segment using DR functions. Second, that they exploit phonotactic constraints on the possible pronunciations of words in their language. Specifically, they exploit both the requirement that every word
Regular languages and partial commutations
"... The closure of a regular language under a [partial] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial] commutation still regular? (2) Are there any robust classes of languages closed under [p ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The closure of a regular language under a [partial] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial] commutation still regular? (2) Are there any robust classes of languages closed under
The SizeChange Principle for Program Termination
, 2001
"... The \sizechange termination" principle for a rstorder functional language with wellfounded data is: a program terminates on all inputs if every innite call sequence (following program control ow) would cause an innite descent in some data values. Sizechange analysis is based only on local ..."
Abstract

Cited by 203 (14 self)
 Add to MetaCart
The \sizechange termination" principle for a rstorder functional language with wellfounded data is: a program terminates on all inputs if every innite call sequence (following program control ow) would cause an innite descent in some data values. Sizechange analysis is based only
Closure of regular languages under semicommutations
, 2011
"... The closure of a regular language under a [partial, semi] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial, semi] commutation still regular? (2) Are there any robust classes of languages c ..."
Abstract
 Add to MetaCart
The closure of a regular language under a [partial, semi] commutation I has been extensively studied. We present new advances on two problems of this area: (1) When is the closure of a regular language under [partial, semi] commutation still regular? (2) Are there any robust classes of languages
Identifying Regular Languages over PartiallyCommutative Monoids
"... . We define a new technique useful in identifying a subclass of regular languages defined on a free partially commutative monoid (regular trace languages), using equivalence and membership queries. Our algorithm extends an algorithm defined by Dana Angluin in 1987 to learn DFA's. The words of a ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. We define a new technique useful in identifying a subclass of regular languages defined on a free partially commutative monoid (regular trace languages), using equivalence and membership queries. Our algorithm extends an algorithm defined by Dana Angluin in 1987 to learn DFA's. The words
The global dimension of commutative regular rings
 Houston J. Math
, 1976
"... 1. Introduction. Let R be a commutative ring that is regular in the sense of Von Neumann. Let S be the Boolean ring of idempotents of R. It is well known that every ideal of R is generated by elements of S, and the mapping J • J f • S is an isomorphism of the ideal lattice of R onto the ideal latti ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
1. Introduction. Let R be a commutative ring that is regular in the sense of Von Neumann. Let S be the Boolean ring of idempotents of R. It is well known that every ideal of R is generated by elements of S, and the mapping J • J f • S is an isomorphism of the ideal lattice of R onto the ideal
Generalized Synchronization Languages and Commutations
 Proc. of 12th International Symposium on Fundamentals of Computation Theory (FCT'99), Lect. Notes Comput. Sci. 1684
, 1999
"... . Generalized synchronization languages are a model used to describe the behaviors of distributed applications whose synchronization constraints are expressed by generalized synchronization expressions  an extension of synchronization expressions. Generalized synchronization languages were conjec ..."
Abstract
 Add to MetaCart
conjectured by Salomaa and Yu to be characterized by a semicommutation. We show that this semicommutation characterizes the images of generalized synchronization languages by a morphismlike class of rational functions. Topics. Automata and formal languages, theory of parallel and distributed computation
Parikh’s theorem in commutative Kleene algebra
 In Logic in Computer Science
, 1999
"... Parikh’s Theorem says that the commutative image of every context free language is the commutative image of some regular set. Pilling has shown that this theorem is essentially a statement about least solutions of polynomial inequalities. We prove the following general theorem of commutative Kleene ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
Parikh’s Theorem says that the commutative image of every context free language is the commutative image of some regular set. Pilling has shown that this theorem is essentially a statement about least solutions of polynomial inequalities. We prove the following general theorem of commutative Kleene
When does partial commutative closure preserve regularity?
 ICALP 2008, REYKJAVIK: ISLANDE
, 2008
"... The closure of a regular language under commutation or partial commutation has been extensively studied [1, 11, 12, 13], notably in connection with regular model checking [2, 3, 7] or in the study of Mazurkiewicz traces, one of the models ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
The closure of a regular language under commutation or partial commutation has been extensively studied [1, 11, 12, 13], notably in connection with regular model checking [2, 3, 7] or in the study of Mazurkiewicz traces, one of the models
When does partial commutative closure preserve regularity?
"... The closure of a regular language under commutation or partial commutation has been extensively studied [1, 11, 12, 13], notably in connection with regular model checking [2, 3, 7] or in the study of Mazurkiewicz traces, one of the models ..."
Abstract
 Add to MetaCart
The closure of a regular language under commutation or partial commutation has been extensively studied [1, 11, 12, 13], notably in connection with regular model checking [2, 3, 7] or in the study of Mazurkiewicz traces, one of the models
Results 1  10
of
651