433 search results - page 38 / 87 » On stabilizers of infinite words |
86
Voted
BIRTHDAY
2008
Springer
15 years 2 months ago
2008
Springer
One of the surprising developments in the area of program verification is how ideas introduced originally by logicians in the 1950s ended up yielding by 2003 an industrial-standard...
111
Voted
COLING
1996
15 years 2 months ago
1996
Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algor...
110
Voted
DLT
2010
15 years 29 days ago
2010
We show that for every deterministic bottom-up tree transducer, a unique equivalent transducer can be constructed which is minimal. The construction is based on a sequence of norma...
101
Voted
CORR
2008
Springer
15 years 25 days ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...
80
Voted
IPL
2008
15 years 23 days ago
2008
We extend Lutz's resource-bounded measure to probabilistic classes, and obtain notions of resource-bounded measure on probabilistic complexity classes such as BPE and BPEXP. ...