186
click to vote
LATA
14 years 27 min 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 ...
145
click to vote
LATA
14 years 26 min 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...
LATA
14 years 32 min ago
2012 Springer |