Time Varying Splicing Recognizers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamical Recognizers : Real - time Language

We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in R d by composing iterated maps, and then apply inequalities to the resulting point to test for membership in the language. Each class of maps and inequalities, such as quadratic functions with rational coeecients, is capable of recognizing a particular class of lan...

متن کامل

FINITE-TIME PASSIVITY OF DISCRETE-TIME T-S FUZZY NEURAL NETWORKS WITH TIME-VARYING DELAYS

This paper focuses on the problem of finite-time boundedness and finite-time passivity of discrete-time T-S fuzzy neural networks with time-varying delays. A suitable Lyapunov--Krasovskii functional(LKF) is established to derive sufficient condition for finite-time passivity of discrete-time T-S fuzzy neural networks. The dynamical system is transformed into a T-S fuzzy model with uncertain par...

متن کامل

Finite time stabilization of time-delay nonlinear systems with uncertainty and time-varying delay

In this paper, the problem of finite-time stability and finite-time stabilization for a specific class of dynamical systems with nonlinear functions in the presence time-varying delay and norm-bounded uncertainty terms is investigated. Nonlinear functions are considered to satisfy the Lipchitz conditions. At first, sufficient conditions to guarantee the finite-time stability for time-delay nonl...

متن کامل

Approximation Solutions for Time-Varying Shortest Path Problem

Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SN Computer Science

سال: 2021

ISSN: 2662-995X,2661-8907

DOI: 10.1007/s42979-020-00439-x