<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//TaxonX//DTD Taxonomic Treatment Publishing DTD v0 20100105//EN" "../../nlm/tax-treatment-NS0.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:tp="http://www.plazi.org/taxpub" article-type="research-article" dtd-version="3.0" xml:lang="en">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher-id">109</journal-id>
      <journal-id journal-id-type="index">urn:lsid:arphahub.com:pub:3dc5f44e-8666-58db-bc76-a455210e8891</journal-id>
      <journal-title-group>
        <journal-title xml:lang="en">JUCS - Journal of Universal Computer Science</journal-title>
        <abbrev-journal-title xml:lang="en">jucs</abbrev-journal-title>
      </journal-title-group>
      <issn pub-type="ppub">0948-695X</issn>
      <issn pub-type="epub">0948-6968</issn>
      <publisher>
        <publisher-name>Journal of Universal Computer Science</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3217/jucs-008-02-0292</article-id>
      <article-id pub-id-type="publisher-id">27860</article-id>
      <article-categories>
        <subj-group subj-group-type="heading">
          <subject>Research Article</subject>
        </subj-group>
        <subj-group subj-group-type="scientific_subject">
          <subject>F.1.1 - Models of Computation</subject>
          <subject>F.1 - COMPUTATION BY ABSTRACT DEVICES</subject>
        </subj-group>
      </article-categories>
      <title-group>
        <article-title>Bridging Two Hierarchies of Infinite Words</article-title>
      </title-group>
      <contrib-group content-type="authors">
        <contrib contrib-type="author" corresp="yes">
          <name name-style="western">
            <surname>Marcus</surname>
            <given-names>Solomon</given-names>
          </name>
          <email xlink:type="simple">solomon.marcus@imar.ro</email>
          <xref ref-type="aff" rid="A1">1</xref>
        </contrib>
      </contrib-group>
      <aff id="A1">
        <label>1</label>
        <addr-line content-type="verbatim">Romanian Academy, Mathematics Calea Victoriei 125, Bucharest, Romania</addr-line>
        <institution>Romanian Academy, Mathematics Calea Victoriei 125</institution>
        <addr-line content-type="city">Bucharest</addr-line>
        <country>Romania</country>
      </aff>
      <author-notes>
        <fn fn-type="corresp">
          <p>Corresponding author: Solomon Marcus (<email xlink:type="simple">solomon.marcus@imar.ro</email>).</p>
        </fn>
        <fn fn-type="edited-by">
          <p>Academic editor: </p>
        </fn>
      </author-notes>
      <pub-date pub-type="collection">
        <year>2002</year>
      </pub-date>
      <pub-date pub-type="epub">
        <day>28</day>
        <month>02</month>
        <year>2002</year>
      </pub-date>
      <volume>8</volume>
      <issue>2</issue>
      <fpage>292</fpage>
      <lpage>296</lpage>
      <uri content-type="arpha" xlink:href="http://openbiodiv.net/4AE68AAE-10D6-5473-9E85-57BBBA397C2C">4AE68AAE-10D6-5473-9E85-57BBBA397C2C</uri>
      <uri content-type="zenodo_dep_id" xlink:href="https://zenodo.org/record/6996131">6996131</uri>
      <permissions>
        <copyright-statement>Solomon Marcus</copyright-statement>
        <license license-type="creative-commons-attribution" xlink:href="" xlink:type="simple">
          <license-p>This article is freely available under the J.UCS Open Content License.</license-p>
        </license>
      </permissions>
      <abstract>
        <label>Abstract</label>
        <p>Infinite words on a finite non-empty alphabet have been investigated in various respects. We will consider here two important strategies in approaching such words; one of them proceeds from particular to general, while the other proceeds from general to particular. As we shall see, the respective hierarchies don’t interfer. There is between them an empty space waiting for investigation.  1.) C. S. Calude, K. Salomaa, S. Yu (eds.). Advances and Trends in Automata and Formal Languages. A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen.</p>
      </abstract>
    </article-meta>
  </front>
</article>
