Access the full text.
Sign up today, get DeepDyve free for 14 days.
Words and Maps 413
Strings and Tries
2 Combinatorial Properties of Bitstrings 366 / 7.3 Regular Expressions 377 / 7.4 Finite-State Automata and the Knuth---Morris-Pratt Algorithm 382 / 7.5 Context-Free Grammars 385 / 7
1 Notation for Asymptotic Approximations 155 / 4.2 Asymptotic Expansions 161 / 4.3 Manipulating Asymptotic Expansions 170 / 4.4 Asymptotic Approximations of Finite Sums 177 / 4
EDUCATION FORUM M a k i n g T h e o r y C o m e Alive Well, I guess it's time to stop talkin' and start walkin'. In the last issue of the News, t h e p r o s p e c t s for creating interactive, a n i m a t e d " h y p e r t e x t b o o k s " - - m a d e possible by H T M L and J a v a - - w e r e explored. In t h a t column and earlier ones, I have noted some of current work being done by various researchers in a n i m a t i o n for c o m p u t e r science education, as well as my own projects in p r o g r a m a n i m a t i o n . I have also m e n t i o n e d m y latest interests in developing interactive a n i m a t i o n s of key concepts
ACM SIGACT News – Association for Computing Machinery
Published: Jul 1, 1996
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.