2465 search results - page 183 / 493 » Automata on Linear Orderings |
ISTA
2003
15 years 2 months ago
2003
: Development of distributed systems is complicated by the absence of reliable global timing, concurrency, and nondeterminism. To deal with these obstacles log files are produced b...
83
Voted
CORR
2010
Springer
15 years 24 days ago
2010
Springer
For several semirings S, two weighted finite automata with multiplicities in S are equivalent if and only if they can be connected by a chain of simulations. Such a semiring S is c...
115
Voted
CORR
2007
Springer
15 years 20 days ago
2007
Springer
We study the existence of automatic presentations for various algebraic structures. An automatic presentation of a structure is a description of the universe of the structure by a...
95
Voted
ENTCS
2007
15 years 19 days ago
2007
Process algebras are standard formalisms for compositionally describing systems by the dependencies of their observable synchronous communication. In concurrent systems, parallel ...
104
Voted
TCS
2008
15 years 18 days ago
2008
We investigate the decidability of observational equivalence and approximation in Reynolds' "Syntactic Control of Interference" (SCI), a prototypical functionalimpe...