Sciweavers

11740 search results - page 239 / 2348
» More Problems in Rewriting
Sort
View
CTRS
1990
15 years 10 months ago
Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Maria Paola Bonacina, Jieh Hsiang
PASTE
2010
ACM
15 years 8 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
FMSB
2008
129views Formal Methods» more  FMSB 2008»
15 years 8 months ago
Rule-Based Modelling, Symmetries, Refinements
Rule-based modelling is particularly effective for handling the highly combinatorial aspects of cellular signalling. The dynamics is described in terms of interactions between part...
Vincent Danos, Jérôme Feret, Walter F...
DLT
2006
15 years 8 months ago
Closure of Language Classes Under Bounded Duplication
Duplication is an operation generating a language from a single word by iterated application of rewriting rules u uu on factors. We extend this operation to entire languages and i...
Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji
CORR
2010
Springer
143views Education» more  CORR 2010»
15 years 6 months ago
Expressiveness of Generic Process Shape Types
METAI is a generic process calculus that can be instantiated by supplying rewriting rules defining an operational semantics to make numerous process calculi such as the -calculus,...
Jan Jakubuv, J. B. Wells