66 search results - page 11 / 14 » Rewriting Haskell Strings |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
JOLLI
2010
13 years 6 months ago
2010
rder Abstract Categorial Grammars as Hyperedge Replacement Grammars Makoto Kanazawa National Institute of Informatics 2–1–2 Hitotsubashi, Chiyoda-ku, Tokyo, 101–8430, Japan A...
CAV
2001
Springer
14 years 3 days ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
DLT
2004
13 years 9 months ago
2004
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying ...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. This paper is a contribution to the long standing open problem of uniform termination of Semi-Thue Systems that consist of one rule s → t. McNaughton previously showed ...