[Keyword: Infinite Word] AND [All Categories: Numerical & Computational Mathematics] : Search

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Advanced Search

SEARCH GUIDE

Results: 1 - 2of2

Follow results:

per page:

Sort: Relevance

Context for search term 1Search term 1*

All Dates

LastSelect static range

Custom Range

Select starting monthSelect starting year

Select ending monthSelect ending year

articleNo Access
TAMENESS OF THE PSEUDOVARIETY LS1
- J. C. COSTA and
- M. L. TEIXEIRA
International Journal of Algebra and Computation01 Oct 2004
Preview Abstract
The notion of κ-tameness of a pseudovariety was introduced by Almeida and Steinberg and is a strong property which implies decidability of pseudovarieties. In this paper we prove that the pseudovariety LSl, of local semilattices, is κ-tame.
articleNo Access
COMPLETE REDUCIBILITY OF THE PSEUDOVARIETY LS1
- JOSÉ CARLOS COSTA and
- CONCEIÇÃO NOGUEIRA
International Journal of Algebra and Computation01 Mar 2009
Preview Abstract
In this paper we prove that the pseudovariety LSl of local semilattices is completely κ-reducible, where κ is the implicit signature consisting of the multiplication and the ω-power. Informally speaking, given a finite equation system with rational constraints, the existence of a solution by pseudowords of the system over LSl implies the existence of a solution by κ-words of the system over LSl satisfying the same constraints.

1