edited dabeer hasan (1 Ergebnisse)

Contents Preface 1 Introduction 2 Finite automata 3 Push down automata 4 Computability theory 5 Regular languages 6 Grammar formalism 7 Parsing 8 Turing machine Bibliography Index In computer science Automata are abstract mathematical models of machines that perform computations on an input by moving through a series of states of configurations If the computation of automation reaches an accepting configuration it accepts that input At each stage of the computation a transition function determines the next configuration on the basis of a finite portion of the present configuration Turing machines are the most general automata They consist of a finite set of states and an infinite tape which contains the input and is used to read and write symbols during the computation Since Turing Machines can leave symbols on their tape at the end of the computation they can be viewed as computing functions the partial recursive functions A language is accepted by automation when it accepts all of the strings in the language and none others Automata theory has given rise to the notion of deterministic computation hence deterministic languages In computer science computation is a general term for any type of information processing This book supposed to shape the field of automata theory would serve students and teachers properly 456 pp.