
AbstractDominoes over a free monoid and operations on them are introduced. Related algebraic systems and their applications to decidability problems about morphisms on free monoids are studied. A new simple algorithm for testing DOL sequence equivalence is presented.
quotient alphabet, Semigroups in automata theory, linguistics, etc., Formal languages and automata, decidability problems, Theoretical Computer Science, Computer Science(all)
quotient alphabet, Semigroups in automata theory, linguistics, etc., Formal languages and automata, decidability problems, Theoretical Computer Science, Computer Science(all)
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
