Automaton Learning Network Theory

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

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

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

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

منابع مشابه

Learning Deterministic Finite Automaton with a Recurrent Neural Network

We consider the problem of learning a nite automaton with recurrent n e u r a l networks from positive evidence. We train Elman recurrent neural networks with a set of sentences in a language and extract a nite automaton by clustering the states of the trained network. We observe that the generalizations beyond the training set, in the language recognized by the extracted automaton, are due to ...

متن کامل

Learning a deterministic finite automaton with a recurrent neural network

We consider the problem of learning a finite automaton with recurrent neural networks, given a training set of sentences in a language. We train Elman recurrent neural networks on the prediction task and study experimentally what these networks learn. We found that the network tends to encode an approximation of the minimum automaton that accepts only the sentences in the training set.

متن کامل

The Neural Network Pushdown Automaton: Model, Stack and Learning Simulations

In order for neural networks to learn complex languages or grammars, they must have sufficient computational power or resources to recognize or generate such languages. Though many approaches have been discussed, one obvious approach to enhancing the processing power of a recurrent neural network is to couple it with an external stack memory in effect creating a neural network pushdown automata...

متن کامل

Learning Stochastic Logical Automaton

This paper is concerned with algorithms for the logical generalisation of probabilistic temporal models from examples. The algorithms combine logic and probabilistic models through inductive generalisation. The inductive generalisation algorithms consist of three parts. The first part describes the graphical generalisation of state transition models. State transition models are generalised by a...

متن کامل

Cellular Automaton Approach to Pedestrian Dynamics - Theory

We present a 2-dimensional cellular automaton model for the simulation of pedestrian dynamics. The model is extremely efficient and allows simulations of large crowds faster than real time since it includes only nearest-neighbour interactions. Nevertheless it is able to reproduce collective effects and self-organization encountered in pedestrian dynamics. This is achieved by introducing a so-ca...

متن کامل

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


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

ژورنال

عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems

سال: 1997

ISSN: 0385-4221,1348-8155

DOI: 10.1541/ieejeiss1987.117.8_1069