Sciweavers

171 search results - page 29 / 35
» On the Power of Tree-Walking Automata
Sort
View
ESOP
2008
Springer
13 years 11 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
FUIN
2007
114views more  FUIN 2007»
13 years 9 months ago
Cellular Devices and Unary Languages
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
Andreas Klein, Martin Kutrib
LATA
2009
Springer
14 years 4 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig
IPPS
2007
IEEE
14 years 4 months ago
Peak-Performance DFA-based String Matching on the Cell Processor
The security of your data and of your network is in the hands of intrusion detection systems, virus scanners and spam filters, which are all critically based on string matching. ...
Daniele Paolo Scarpazza, Oreste Villa, Fabrizio Pe...
COORDINATION
2007
Springer
14 years 4 months ago
Component Connectors with QoS Guarantees
Connectors have emerged as a powerful concept for composition and coordination of concurrent activities encapsulated as components and services. Compositional coordination models a...
Farhad Arbab, Tom Chothia, Sun Meng, Young-Joo Moo...