Introduction to Formal Language Automata Theory and Computation Kamala Krithivasam & Rama R English
Material type:
- 978-81-317-2356-2
- 23 005.131 KRI
Contents:
Preliminaries
Grammars
Finite state automata
Finite State
Finite State Automata:Characterization,Properties,and Decidability
Finite State Automata with Output and Minimization
Variants of Finite Automata
Pushdown Automata
Context-Free Grammars-Properties and Parsing
Turing Machines
Variation of Turing Machines
Universal Turing Machine and Decidability
Time and Space Complexity
Recent Trends and Applications
New Models of computation
Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
![]() |
Tetso College Library Computer Science | Non-fiction | 005.131 KRI (Browse shelf(Opens below)) | Available | 10673 |
Preliminaries
Grammars
Finite state automata
Finite State
Finite State Automata:Characterization,Properties,and Decidability
Finite State Automata with Output and Minimization
Variants of Finite Automata
Pushdown Automata
Context-Free Grammars-Properties and Parsing
Turing Machines
Variation of Turing Machines
Universal Turing Machine and Decidability
Time and Space Complexity
Recent Trends and Applications
New Models of computation
There are no comments on this title.
Log in to your account to post a comment.