174 search results - page 1 / 35 » Traces of Term-Automatic Graphs |
MFCS
2007
Springer
13 years 10 months ago
2007
Springer
In formal language theory, many families of languages are defined using grammars or finite acceptors like pushdown automata and Turing machines. For instance, context-sensitive l...
JALC
2002
13 years 4 months ago
2002
A
ENTCS
2002
13 years 4 months ago
2002
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 ...
RV
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Concurrent trace programs (CTPs) are slices of the concurrent programs that generate the concrete program execution traces, where inter-thread event order specific to th...
ICST
2010
IEEE
13 years 2 months ago
2010
IEEE
Mobile computing systems provide new challenges for verification. One of them is the dynamicity of the system structure, with mobility-induced connections and disconnections, dynam...