منابع مشابه
Synchronized EOL Forms Under Uniform Interpretation
— The aim ofthis paper is thejurther study oj EOLjorms under uniform interprétation. We are naturally led to the considération oj synchronized EOLjorms, which become the central thème of this paper. We prove: a ""strongest"" possible normaljorm resuit, the spanning normalJorm theorem; the non-existence oj uni-generatorsjor "reasonable" language amilies, which include thefinite, regular and cont...
متن کاملSynchronized Realities
Ambient Intelligence (AmI) promises future environments that support the well-being of their inhabitants through comfort and assistive environments. For the elderly users, ambient assisted living (AAL) scenarios are targeting safe and independent living at home. Especially the integration of home automation components, such as intelligent light, window, and climate controls seem promising for s...
متن کاملSynchronized shuffles
Weextend the basic shuffle onwords and languages, awell-known operation in theoretical computer science, by introducing three synchronized shuffles. These synchronized shuffles have some relevance to molecular biology since they may be viewed as the formal representations of various forms of gene linkage during genome shuffling. More precisely, each synchronized shuffle preserves the genetic ba...
متن کاملSynchronized Shuue and Regular Languages Synchronized Shuue and Regular Languages
New representation results for three families of regular languages are stated, using a special kind of shuue operation, namely the synchronized shuue. First, it is proved that the family of regular star languages is the smallest family containing the language (a + bc) and closed under synchronized shuue and length preserving morphism. The second representation result states that the family of "...
متن کاملSimulation of Scattered Context Grammars and Phrase-Structured Grammars by Symbiotic E0L Grammars
This paper contains more examples to formerly introduced concept of formal language equivalency. That is, for two models, there is a substitution by which we change each string of every yield sequence in one model so that sequence ofs string resulting from this change represents a yield sequence in the other equvalent model, these two models closely simulates each other; otherwise they do not. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1980
ISSN: 0304-3975
DOI: 10.1016/0304-3975(80)90026-2