303 search results - page 60 / 61 » Automata on Gauss Words |
SIGSOFT
2007
ACM
14 years 9 months ago
2007
ACM
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
CIE
2007
Springer
14 years 2 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
ISAAC
2003
Springer
14 years 1 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
WIA
2001
Springer
14 years 24 days ago
2001
Springer
This article describes a finite-state cascade for the extraction of person names in texts in French. We extract these proper names in order to categorize and to cluster texts with...
WIA
2001
Springer
14 years 24 days ago
2001
Springer
A formal device is said to be adaptive whenever its behavior changes dynamically, in a direct response to its input stimuli, without interference of external agents, even its user...