Sciweavers

439 search results - page 4 / 88
» On Aperiodic Trace Languages
Sort
View
ICALP
2003
Springer
14 years 28 days ago
On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
Stefan Blom, Wan Fokkink, Sumit Nain
ICALP
2009
Springer
14 years 8 months ago
High Complexity Tilings with Sparse Errors
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
Bruno Durand, Andrei E. Romashchenko, Alexander Sh...
ENTCS
2007
112views more  ENTCS 2007»
13 years 7 months ago
Structure and Properties of Traces for Functional Programs
The tracer Hat records in a detailed trace the computation of a program written in the lazy functional language Haskell. The trace can then be viewed in various ways to support pr...
Olaf Chitil, Yong Luo
MFCS
2001
Springer
14 years 4 days ago
Rational Graphs Trace Context-Sensitive Languages
This paper shows that the traces of rational graphs coincide with the context-sensitive languages.
Christophe Morvan, Colin Stirling
ENTCS
2002
72views more  ENTCS 2002»
13 years 7 months ago
The synchronized graphs trace the context-sensitive languages
Morvan and Stirling have proved that the context-sensitive languages are exactly the traces of graphs defined by transducers with labelled final states. We prove that this result ...
Chloe Rispal