Keyword: Finite Sets Of Words : 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 - 1of1

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

Search name	Searched On	Run search
Keyword: Finite Sets Of Words (1)	31 Mar 2025	Run
Keyword: Surface-knot Diagram (1)	31 Mar 2025	Run
Keyword: Electron Accelerator (6)	31 Mar 2025	Run
Keyword: Lateral Garden Angle (1)	31 Mar 2025	Run
Keyword: Equation Solvability (4)	31 Mar 2025	Run

articleNo Access
THE EQUALITY CONDITION FOR INFINITE CATENATIONS OF TWO SETS OF FINITE WORDS
- BORIS F. MELNIKOV
International Journal of Foundations of Computer Science01 Sep 1993
Preview Abstract
Some special sets of ω-words, namely, the sets that can be obtained by catenating nonempty finite sets of words, an infinite number of times, are considered. A condition for the equality of two such sets of ω-words is obtained.

1