3 search results - page 1 / 1 » lata 2012 |
100
Voted
LATA
2012
Springer
14 years 14 days ago
2012
Springer
149
click to vote
LATA
2012
Springer
14 years 14 days ago
2012
Springer
We investigate the application of Courcelle’s Theorem and the logspace version of Elberfeld et al. in the context of the implication problem for propositional sets of formulae, t...
193
Voted
LATA
2012
Springer
14 years 14 days ago
2012
Springer
The notion of recognition of a language by a finite semigroup can be generalized to recognition by finite groupoids, i.e. sets equipped with a binary operation ‘·’ which is ...