Bounded D0L languages (Q1098317): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5576254 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3899529 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4045671 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the periodicity of morphisms on free monoids / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Periodic D0L languages / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Regularity of sets of initial strings of periodic D0L-systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Code properties and homomorphisms of DOL systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decidability of periodicity for infinite words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4140407 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3948608 / rank | |||
Normal rank |
Latest revision as of 14:53, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounded D0L languages |
scientific article |
Statements
Bounded D0L languages (English)
0 references
1987
0 references
The authors show that for a given alphabet A and a morphism h the set of words w such that the D0L language L(A,h,w) is bounded (i.e. is a subset of \(x\) \(*_ 1x\) \(*_ 2...x\) \(*_ n\) for some words \(x_ 1,x_ 2,...,x_ n\) over A) is B *, where B is an effectively computable subset of A. This implies that it is decidable whether a given D0L system \(S=(A,h,w)\) generates a bounded set. Moreover, if \(S=(A,h,w)\) is a polynomially bounded D0L system (i.e. the growth function of S is bounded by some polynomial) then L(S) is bounded if and only if S is linearly bounded.
0 references
bounded D0L languages
0 references
periodic D0L languages
0 references
D0L system
0 references