263 search results - page 37 / 53 » Rigid Tree Automata |
220
click to vote
POPL
2004
ACM
16 years 3 months ago
2004
ACM
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
133
click to vote
ASE
2002
15 years 3 months ago
2002
This paper describes a specialized interface to PVS called TAME (Timed Automata Modeling Environment) which provides automated support for proving properties of I/O automata. A maj...
151
click to vote
DBPL
2005
Springer
15 years 8 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
111
Voted
IJFCS
2008
15 years 3 months ago
2008
We consider the problem of synchronizing the activity of all the membranes of a P system. After pointing at the connection with a similar problem dealt with in the field of cellul...
136
Voted
TCS
2010
14 years 10 months ago
2010
The theorem of factorization forests of Imre Simon shows the existence of nested factorizations -- `a la Ramsey -- for finite words. This theorem has important applications in sem...