Metadata
Author: WikiMatrix
Data
English[en]
Redwood City, California: Benjamin/Cummings Publishing Company, Inc. Appendix C includes impossibility of algorithms deciding if a grammar contains ambiguities, and impossibility of verifying program correctness by an algorithm as example of Halting Problem.
Croatian[hr]
Theory of Computation: Formal Languages, Automata, and Complexity, Redwood City, California: Benjamin/Cummings Publishing Company, Inc. Appendix C uključuje nemogućnost algoritama koji odlučuju sadrži li gramatika nejednoznačnosti, te nemogućnost verificiranja ispravnosti programa algoritmom kao primjer problema zaustavljanja.