3229 search results - page 144 / 646 » The Theory of Timed Automata |
139
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
d abstract) Benjamin Carle, Paliath Narendran and Colin Scheriff Dept. of Computer Science University at Albany–SUNY Albany, NY 12222 June 19, 2007 In this paper we extend the ...
131
click to vote
LATA
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we prove the following result. Let s be an infinite word on a finite alphabet, and N ≥ 0 be an integer. Suppose that all left special factors of s longe...
159
click to vote
LATA
2010
Springer
16 years 29 days ago
2010
Springer
Operator precedence languages, designated as Floyd’s Languages (FL) to honor their inventor, are a classical deterministic context-free family. FLs are known to be a boolean fami...
126
click to vote
CIE
2005
Springer
16 years 18 hour ago
2005
Springer
Abstract. We discuss some known and introduce some new reducibilities on regular sets. We establish some facts on the corresponding degree structures and relate some reducibilities...
155
click to vote
EUROCAST
2005
Springer
16 years 9 hour ago
2005
Springer
In this paper, we present a new pseudo-random sequence generator, constructed by the generalized discrete Baker transformation. This new generator is called Cascaded Baker Register...