H. Doostie

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
For a finitely generated automatic semigroup $$S=\langle A\rangle $$ S = ⟨ A ⟩ we define a semigroup $$L_S$$ L S of languages concerning the automatic structure of S, and study the automaticity of $$L_S$$ L S . Also we investigate the natural question “when S is isomorphic to $$L_S$$ L S ?”. Finally, we attempt to verify the equation $$L_S\cup L_T=L_{S\cup(More)
  • 1