1650 search results - page 114 / 330 » The HOM problem is decidable |
ENTCS
2000
13 years 10 months ago
2000
It is an open problem whether weak bisimilarity is decidable for Basic Process Algebra (BPA) and Basic Parallel Processes (BPP). A PSPACE lower bound for BPA and NP lower bound fo...
FUIN
2000
13 years 10 months ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
ICGI
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Grammatical inference is typically defined as the task of finding a compact representation of a language given a subset of sample sequences from that language. Many di...
MFCS
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automa...
IANDC
2011
13 years 5 months ago
2011
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...