Two-way automaton computations

نویسندگان

چکیده

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

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

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

منابع مشابه

Sampling a Two-way Finite Automaton

We study position sampling in a two-way nondeterministic finite automaton (2NFA) to measure information flow between state variables, based on the information-theoretic sampling technique proposed in [20]. We prove that for a 2NFA, the language generated by position sampling is regular. We also show that for a 2NFA, we can effectively find a vector of sampling positions that maximizes informati...

متن کامل

The Taming of Converse: Reasoning about Two-way Computations

We consider variants o f propositional dynamic logic (PDL) augmented with the converse construct. Intuitively, the converse a of a program a is a programs whose semantics is to run a backwards. While PDL consists o f assertions about weakest preconditions, the converse construct enable us to make assertions about strongest postconditions. We investigate the interaction of converse with two cons...

متن کامل

A New Cellular Automaton Model for Urban Two-Way Road Networks

A new cellular automaton (CA) model is proposed to simulate traffic dynamics in urban two-way road network systems. The NaSch rule is adopted to represent vehicle movements on road sections. Two novel rules are proposed to move the vehicles in intersection areas, and an additional rule is developed to avoid the "gridlock" phenomenon. Simulation results show that the network fundamental diagram ...

متن کامل

One-Way Functions in Reversible Computations

One-way functions are used in modern crypto-systems as doortraps because their inverse functions are supposed to be difficult to compute. Nonetheless with the discovery of reversible computation, it seems that one may break a one-way function by running a reversible computer backward. Here, we argue that reversible computation alone poses no threat to the existence of one-way functions because ...

متن کامل

Two-dimensional Burgers Cellular Automaton

In this paper, a two-dimensional cellular automaton(CA) associated with a two-dimensional Burgers equation is presented. The 2D Burgers equation is an integrable generalization of the well-known Burgers equation, and is transformed into a 2D diffusion equation by the Cole-Hopf transformation. The CA is derived from the 2D Burgers equation by using the ultradiscrete method, which can transform d...

متن کامل

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


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

ژورنال

عنوان ژورنال: RAIRO - Theoretical Informatics and Applications

سال: 1990

ISSN: 0988-3754,1290-385X

DOI: 10.1051/ita/1990240100471