415 search results - page 9 / 83 » Regular Processes and Timed Automata |
139
click to vote
DBPL
2005
Springer
15 years 7 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
115
click to vote
NIPS
2003
15 years 3 months ago
2003
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
101
click to vote
FSMNLP
2005
Springer
15 years 7 months ago
2005
Springer
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expres...
152
click to vote
ICIAP
1999
ACM
15 years 6 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
138
click to vote
IJFCS
2008
15 years 1 months ago
2008
Abstract. Recently, it has been shown that for any higher order pushdown system H and for any regular set C of configurations, the set pre H(C), is regular. In this paper, we give ...