762 search results - page 100 / 153 » Intercode Regular Languages |
CASCON
1997
15 years 3 months ago
1997
The explosion in the amount of free text materials on the Internet, and the use of this information by people from all walks of life, has made the issue of generalized information...
103
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
119
click to vote
ACTA
2010
15 years 2 months ago
2010
Systems of Data Management Timed Automata (SDMTAs) are networks of communicating timed automata with structures to store messages and functions to manipulate them. We prove the dec...
115
Voted
ECCC
2008
15 years 2 months ago
2008
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...
112
click to vote
ACTA
2005
15 years 2 months ago
2005
It is known that LTL formulae without the `next' operator are invariant under the so-called stutter-equivalence of words. In this paper we extend this principle to general LTL...