As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 11 years ago.
Please suggest me some good books on "Formal languages and Automata Theory".
Thanks!
The book here is Introduction to Automata Theory, Languages and Computation by Hopcroft, Motwani and Ullman (Ullman is one of the dragon book guys). (I recommend finding an older edition in your library if you can; the older editions were shorter and I don't see much value in the additional material in the new editions).
Another great book is Introduction to the Theory of Computation by Sipser.
You can not go wrong with one of those two.
I recommend this book. It's used for the CMU course.
http://www.amazon.ca/Introduction-Theory-Computation-Second-Michael/dp/0534950973
but this one is the gold standard
http://en.wikipedia.org/wiki/File:Hopcroft-ullman-79-cover.jpg
depends what level you're looking for. we used Peter Linz's An Introduction to Formal Languages and Automata, Fourth Edition in my intro class and i liked it.
google books preview
Some material by Rosenberg:
http://www.springer.com/math/cse/book/978-0-387-09638-4
Related
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 9 years ago.
I want to know the answer to this question from a technical point of view,
Is COBOL still worth leaning?
What I mean is this: there are some languages you can learn to become a better programmer, for example leaning the assembler can help to understand how a computer work, or learning a functional language when you know an OOP language can teach you to look at programming from another point of view, another way of thinking. Does COBOL have such an advantage?
Learning COBOL is just about the money...
COBOL is actively used in big financial or policy cooperations which have their system from the 80ths and wont want to change it.
In order to keep their system running and updated they need cobol programmers. But today a lot of these programmers are retiring and a lot are bought back to their jobs while doubling their salary.
COBOL isn't pretty or much fun but you can earn some money with it.
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 10 years ago.
OK. this might be a very basic question to please don't flame me but I have been googling I want to learn how to write solutions to transportation problems like Wolf, Cabbage, and Goat or traveling salesman using F#
so far my research has taken me to these resources on the web
http://mat.gsia.cmu.edu/orclass/integer/integer.html
http://www.zib.de/Publications/Reports/SC-95-27.pdf
Fox-Goat-Cabbage Transportation
http://www.qauprogrammers.com/Article/File-192324030/PROLOG-Programming-with-NET
but despite reading thru these, I have not been able to "think" on how should such a problem be solved in F# type of language
I'd recommend going thru the excellent article Escape from Zurg: An Exercise in Logic Programming. Although the functional language of choice there is Haskell, it should give you enough ideas about programming of optimal search problems functionally.
Also Escape from Zurg in Scala has full source code easily portable to F#.
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 10 years ago.
I've been trying to find a good tutorial on how to program randomized tile generation (2D). However it seems that i cannot find any proper tutorials on that.
Is there any books and/or websites with proper tutorials on how to program it and the math behind it?
I know this is not a programming question per se however it is programming related, so hopefully someone can help me out with a link or two.
A good introduction to random terrains
Very basic 2D terrain tutorial
And .this one i found a little more confusing, but it has a lot
of example code.
But remember if you use other people's code give them credit :) hope these help.
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 10 years ago.
More I'm going on with MongoID driver for MongoDB nosql models in my Rails apps, more I feel don't knowing so much about the full expressiveness, elasticity and powerness of its constructs.
Mongoid docs is one of the clearest, easy and usefull documentation around the blok, but still not enough to understand the implication in the deep.
Think for example at the design/performance/scalability/refactorability implication of using embedded one to many vs referenced one to many
I'm looking for source of examples and eventually online tutorials, articles and books to go deeper here.
Thanks in advance
luca
Design and scalability are more related to the database itself. I'm going through "MongoDb the definitive guide" book right now before jumping into mongoid to gain better understanding
As it currently stands, this question is not a good fit for our Q&A format. We expect answers to be supported by facts, references, or expertise, but this question will likely solicit debate, arguments, polling, or extended discussion. If you feel that this question can be improved and possibly reopened, visit the help center for guidance.
Closed 11 years ago.
I need a good stemming algorithm for a project I'm working on. It was suggested that I look at the Porter Stemmer. When I checked out the page on the Porter stemmer I found that it is deprecated now in favor of the "Snowball" stemmer.
I need a good stemmer, but I can't really spend significant time implementing (or optimizing) my own. What is the best "off the shelf", freely available stemmer? Are there any non-free stemmers available for a reasonable price? Or, is the Snowball stemmer my best bet?
The Porter2 stemmer is the one I've decided to go with. It seemed the porter stemmer was the standard, but when I found the page by the author he recommended the "Snowball (Porter2)" stemmer. There is a C port link on this page.
It really depends on how you're planning to apply it. The Natural Language Toolkit (http://nltk.sourceforge.net) has a number of stemmers implemented in it that should be able to handle most applications. I prefer the Morphy stemmer.
Of course, it's available in Python, so if you're working with another language, you can always look through the code to glean the algorithm and transfer it to your language of choice. Python is highly readable.