Text

INTRODUCTION TO AUTOMATA THEORY,LANGUAGES AND COMPUTATION

---

Using this theorem, we construct a machine, i.e., M R , to recognize pseudo-irrelevant updates (Algorithm 2). Algorithm 2 creates finite state machines using standard operators including concatenation ( • ), union (∪), intersection (∩), and complement (M ) . (We assume that the built-in function fsm() eliminates all capture variables from an input regular formula and converts the result to its equivalent finite state machine.) ...

---

Ketersediaan

79229

629.8.312 HOP I

Library Lantai 3

Tersedia

Informasi Detil

Judul Seri

-

No. Panggil

629.8.312 HOP I

Penerbit

Philippines : Addison Wesley Longman., 1979

Deskripsi Fisik

418 hlm

Bahasa

English

ISBN/ISSN

0-201-45556-0

Klasifikasi

NONE

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

1

Subyek

LANGUAGES AND COMPUTATION

Info Detil Spesifik

-

Pernyataan Tanggungjawab

-

Versi lain/terkait

Lampiran Berkas

Komentar

---

You must be logged in to post a comment