Studies in Computer Science, Volume 22

abstract algorithm applications approach areas artificial intelligence associated automata basic block characterization Chomsky Normal Form class of languages computer science consider context context-free grammar context-free languages context-sensitive context-sensitive languages Curriculum defined definition derivation deterministic digital computer drug EDVAC ENIAC entities equations error evaluation example execution Figure finite finite-state acceptor formal language theory function game tree given gram grammar G Greibach heuristic programs histogram homomorphism implementation instructions integer languages accepted linear context-free loop mathematical matrix methods natural language nondeterministic pushdown store numerical analysis operands operations output parameters parse tree polynomial position problem procedure produce programming language pushdown store acceptor puter queue random variable recursive regular expression regular sets represents resolution principle result sequence SIMSCRIPT simulation solution specified statement statistical step storage string symbol tape techniques terminal THEOREM tion tree Turing machine