1175 search results - page 75 / 235 » Abstract computability and algebraic specification |
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
The main goal of this paper is to show that pattern recognition techniques can be successfully used in abstract algebra. We introduce a pattern recognition system to recognize wor...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We study a process algebra which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s simple probabilistic automata. We consider...
CIE
2010
Springer
14 years 16 days ago
2010
Springer
Containers are a semantic way to talk about strictly positive types. In previous work it was shown that containers are closed under various constructions including products, coprod...
ACMMPC
2000
Springer
14 years 2 days ago
2000
Springer
Abstract. These notes deal with an interconnecting web of mathematical techniques all of which deserve a place in the armoury of the welleducated computer scientist. The objective ...
CONCUR
1997
Springer
13 years 12 months ago
1997
Springer
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...