Wyniki wyszukiwania - Biblioteka Nauki

Nowa wersja platformy, zawierająca wyłącznie zasoby pełnotekstowe, jest już dostępna.
Przejdź na https://bibliotekanauki.pl

Ograniczanie wyników

2 Fundamenta Informaticae

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: biomolecular computing

Sortuj według:

Ogranicz wyniki do:

Time-Varying Distributed H Systems: An Overview

100%

Margenstern M. , Verlan S. , Rogozhin Y.

Fundamenta Informaticae

2005

tom Vol. 64, nr 1-4

291-306

Time-varying distributed H systems are a well known model of molecular computing. In this article we present an overview of this model, its history, related results, and open problems.

Enforcing Regular Languages

88%

Genova D. , Hoogeboom H. J.

Fundamenta Informaticae

2017

tom Vol. 154, nr 1/4

131--144

We investigate regular languages in the context of the forbidding-enforcing systems introduced by Ehrenfeucht and Rozenberg in the variant where one fe-system defines a single language. In general, these systems may have infinite sets of rules, allowing one to define arbitrary languages. On the other hand when restricted to finite sets, one obtains a strict subclass of the regular languages, between the strictly locally testable and locally testable languages. We further investigate classes of enforcing systems that characterize the regular languages. These systems have infinite sets of enforcers, but can be defined using regular languages (finite state automata).