first
prev
toc
next
last
Download Citation
Recommend
Mark
Alert
Link
Print
On infinite HD0L words having sparse letters
Author:
Juha Honkala a
| Affiliation: | a Department of Mathematics, University of Turku, Turku, Finland |
DOI:
10.1080/00207160310001650125
Publication Frequency:
15 issues per year
Published in:
International Journal of Computer Mathematics,
Volume
81,
Issue
2
February
2004
, pages 133
- 139
International Journal of Computer Mathematics,
Volume
81,
Issue
2
February
2004
, pages 133
- 139
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
We discuss the equality problem for infinite words generated by HD0L systems having sparse letters.
|
| Keywords: D0L systems; HD0L systems; Infinite words; Decidability |
| view references (11) |
|
Bookmark with:
|
CiteULike
Del.icio.us
BibSonomy
Connotea
More bookmarks
