first
prev
toc
Download Citation
Recommend
Mark
Alert
Link
Print
Some Characterization of Recursively Enumerable Sets
Author:
Wit Foryś a
| Affiliation: | a Jagiellonian University, Institute of Computer Science, Nawojki 11, 30-072 Krakow, Poland. |
DOI:
10.1080/00207160211924
Publication Frequency:
15 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
79,
Issue
2
2002
, pages 157
- 163
International Journal of Computer Mathematics,
Volume
79,
Issue
2
2002
, pages 157
- 163
Subjects:
Analysis - Mathematics;
Bioinformatics;
Computer Mathematics;
Discrete Mathematics;
Mathematical Finance;
Mathematical Logic;
Mathematical Numerical Analysis;
Systems & Computer Architecture;
Number of References: 11
Formats available:
PDF
(English)
Article Requests:
Order Reprints
:
Request Permissions
-
Single Article Purchase:
US$37.00
-
buy now
-
Sign In
- Online Sample
add to cart 
[ show other buying options ]
View Article:
View Article (PDF)
Abstract
The paper presents some characterization of recursively enumerable subsets of a free monoid. The characterization uses a morphism and a fixed point set of a bifaithful rational relation.
|
| Keywords: Free Monoid; Words; Recursively Enumerable Sets; Rational Relations; Fixed Points Of Rational Relations |
| view references (11) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
