38 search results - page 8 / 8 » Minimizing Deterministic Lattice Automata |
CSR
2010
Springer
15 years 4 months ago
2010
Springer
We introduce the notion of sofic tree-shifts which corresponds to symbolic dynamical systems of infinite trees accepted by finite tree automata. We show that, contrary to shifts of...
116
click to vote
APLAS
2003
ACM
15 years 4 months ago
2003
ACM
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...
101
click to vote
DLT
2006
15 years 2 months ago
2006
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...