8196 search results - page 309 / 1640 » Computational Modeling and Complexity Science |
191
Voted
STACS
2004
Springer
15 years 12 months ago
2004
Springer
An Active Context-Free Game is a game with two players (Romeo and Juliet) on strings over a finite alphabet. In each move, Juliet selects a position of the current word and Romeo ...
158
click to vote
CSR
2010
Springer
15 years 10 months ago
2010
Springer
We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift, and we are interested in its complexity in terms of r...
177
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Matrix interpretations can be used to bound the derivational complexity of rewrite systems. We present a criterion that completely characterizes matrix interpretations that are pol...
151
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
Zielonka's theorem shows that each regular set of Mazurkiewicz traces can be implemented as a system of synchronized processes provided with some distributed control structure...
168
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Block codes are first viewed as finite state automata represented as trellises. A technique termed subtrellis overlaying is introduced with the object of reducing decoder...