A tree language of a fixed type τ is any set of terms of type τ . We consider here a binary operation + n on the set W τ ( X n ) of all n -ary terms of type τ , which results in semigroup ( W τ ( X n ), + n ). We characterize languages which are idempotent with respect to this binary operation, and look at varieties of tree languages containing idempotent languages. We also compare properties of semigroup homomorphisms from (𝒫( W τ ( X n ));+ n ) to (𝒫( W τ ( X m ));+ m ) with properties of homomorphisms between the corresponding absolutely free algebras ℱ τ ( X n ) and ℱ τ ( X m ).
Inhalt
-
Open AccessIdempotent tree languages10. Mai 2017
-
10. Mai 2017
-
Open AccessFour-dimensional matrix transformation and A-statistical fuzzy Korovkin type approximation10. Mai 2017
-
10. Mai 2017
-
10. Mai 2017
-
10. Mai 2017
-
10. Mai 2017
-
10. Mai 2017
-
Open AccessOn Hopf bifurcation of Liu chaotic system10. Mai 2017
-
10. Mai 2017
-
Open AccessOn asymmetric I and I∗-divergence10. Mai 2017
-
Open AccessSome new factor theorem for absolute summability10. Mai 2017
-
10. Mai 2017
-
10. Mai 2017
-
10. Mai 2017
-
10. Mai 2017
-
10. Mai 2017
-
10. Mai 2017
-
Open AccessRcl-supercontinuous functions10. Mai 2017