8 search results - page 2 / 2 » An Algorithm for Deciding BAPA: Boolean Algebra with Presbur... |
LFCS
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Balanced search trees provide guaranteed worst-case time performance and hence they form a very important class of data structures. However, the self-balancing ability co...
FROCOS
2009
Springer
13 years 11 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
IPL
2007
13 years 4 months ago
2007
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...