18 search results - page 2 / 4 » On the computation of quotients and factors of regular langu... |
CAV
2001
Springer
13 years 9 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
TCS
2011
13 years 6 days ago
2011
In this paper, we introduce block insertion and deletion on trajectories, which provide us with a new framework to study properties of language operations. With the parallel synta...
DFT
2009
IEEE
13 years 8 months ago
2009
IEEE
Optimizing the BIST configuration based on the characteristics of the design under test is a complicated and challenging work for test engineers. Since this problem has multiple o...
SIGITE
2005
ACM
13 years 10 months ago
2005
ACM
The direct experience we had with teaching a summer pre-college computing course in which we adopted an online portfolio approach has led us to consider the use of online portfoli...
COGSCI
2008
13 years 5 months ago
2008
How children go about learning the general regularities that govern language, as well as keeping track of the exceptions to them, remains one of the challenging open questions in ...