Matsushita, T. and Runciman, C. (2001) The accepting power of unary string logic programs. Theoretical Computer Science, 266 (1-2). pp. 59-79. ISSN 0304-3975Full text not available from this repository.
The set of programs written in a small subset of pure Prolog called US is shown to accept exactly the class of regular languages. The language US contains only unary predicates and unary function symbols. Also, a subset of US called RUS is shown to be equivalent to US in its ability in accepting the class of regular languages. Every clause in RUS contains at most one function symbol in the head and at most one literal with no function symbol in the body. The result is very close to a theorem of Matos (TCS April 1997) but our proof is quite different. Though US and RUS have the same accepting power, their conciseness of expression is dramatically different: if we try to write an RUS program equivalent to a US program, the number of predicates in the RUS program could be O(22N) where N is the sum of the number of predicates and the number of functors in the US program.
|Institution:||The University of York|
|Academic Units:||The University of York > Computer Science (York)|
|Depositing User:||York RAE Import|
|Date Deposited:||11 Feb 2009 10:51|
|Last Modified:||11 Feb 2009 10:51|
|Publisher:||Elsevier Science B.V., Amsterdam|