10304 search results - page 389 / 2061 » Computer science with the sciences: an emphasis in computati... |
189
Voted
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
207
click to vote
DLT
2009
15 years 4 months ago
2009
A survey of applications of factorization forests. Fix a regular language L A . You are given a word a1