12 search results - page 1 / 3 » Automatic Groups and String Rewriting |
AC
1993
Springer
13 years 10 months ago
1993
Springer
PADL
2007
Springer
14 years 8 days ago
2007
Springer
Abstract The Haskell String type is notoriously inefficient. We introduce a new data type, ByteString, based on lazy lists of byte arrays, combining the speed benefits of strict a...
RTA
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. In this paper it is described how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method and semantic labelling c...
CAIP
1995
Springer
13 years 9 months ago
1995
Springer
This paper describes tools for character string recognition on maps. Single character recognition is performed using elliptical Fourier descriptors applying a statistical classi er...
SOFSEM
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...