130 search results - page 13 / 26 » The Language Theory of Bounded Context-Switching |
CORR
2009
Springer
13 years 5 months ago
2009
Springer
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their g...
FOCS
2003
IEEE
14 years 21 days ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...
CORR
2004
Springer
13 years 7 months ago
2004
Springer
Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the safe omission of the occ...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Scenario languages based on Message Sequence Charts (MSCs) have been widely studied in the last decade [21,20,3,15,12,19,14]. The high expressive power of MSCs renders many basic ...
TCS
2010
13 years 2 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...