DLearn
74 subscribers
139 photos
1 video
42 files
Archive

@Faulkon

-- Powered by decoder TM
@de_coder
-- Books
@debrary
Download Telegram
فصل 4
FDs and BCNF (informal)
Book:
Database Design and Relational Theory
Author:
CJ. Date
#database
فصل 4
FDs and BCNF (informal)
Book:
Database Design and Relational Theory
Author:
CJ. Date
#database
Book:
Database System Concept
Author:
Silberchatz
Edition:
seventh
#database
Book:
Database System Concept
Author:
Silberchatz
Edition:
seventh
#database
Book:
Database System Concept
Author:
Silberchatz
Edition:
seventh
#database
Book:
Database System Concept
Author:
Silberchatz
Edition:
seventh
#database
Book:
Database System Concept
Author:
Silberchatz
Edition:
seventh
#database
Book:
Database System Concept
Author:
Silberchatz
Edition:
seventh
#database
Midterm2Practice.pdf
206.7 KB
middle term 2014
texas University
#computation_theory
FinalPracticeOnWeb.pdf
37.1 KB
final exam 2014
texas University
#computation_theory
Book:
Database System Concept
Author:
Silberchatz
Edition:
seventh
#database
Book:
Database System Concept
Author:
Silberchatz
Edition:
seventh
#database
Book:
Database System Concept
Author:
Silberchatz
Edition:
seventh
#database
Book:
Introduction to Language and Theory of Computaion
Author:
John Martin
Edition:
4th
#computation_theory
#finit_Automata_and_language
Book:
Introduction to Language and Theory of Computaion
Author:
John Martin
Edition:
4th
#computation_theory
#finit_Automata_and_language
Book:
Introduction to Language and Theory of Computaion
Author:
John Martin
Edition:
4th
#computation_theory
#finit_Automata_and_language
Book:
Introduction to Language and Theory of Computaion
Author:
John Martin
Edition:
4th
#computation_theory
#finit_Automata_and_language
Book:
Introduction to Language and Theory of Computaion
Author:
John Martin
Edition:
4th
#computation_theory
#finit_Automata_and_language
یک سوال زیبا و آموزنده
Book:
Introduction to Language and Theory of Computaion
Author:
John Martin
Edition:
4th
#computation_theory
#finit_Automata_and_language
DLearn
یک سوال زیبا و آموزنده Book: Introduction to Language and Theory of Computaion Author: John Martin Edition: 4th #computation_theory #finit_Automata_and_language
من همچین جوابی دادم ،
اگر در حالت نهایی زبان L یک تابع گذر مثلا به حالت تله یا trap با همه‌ی الفبای داشته باشیم ، حالا اگر بیاییم به حالت نهایی تابع گذر *a را بذاریم آنگاه زبان L تغیر میکنه .

دوستان اگر میتونن این جواب رو درست یا غلط بودنشون رو بگن ممنون میشم