Closed. This q开发者_如何学Gouestion is off-topic. It is not currently accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow.
I always thought that there was no real language class below type-3 grammars, but now I found the \"Language identification in the limit\" model which allows learning of pattern languages but not regu
I like reading about programming theories, so could you tell me if there is any object-oriented static typed language that allow variables to have a few types?
Is there a library (in any language) that can search pa开发者_如何学Ctterns in matrixes like regular expressions work for strings ?Something like regular expresions for matrixes, or any matrix pattern
Closed. This question is off-topic. It is not currentl开发者_高级运维y accepting answers. Want to improve this question? Update the question so it's on-topic for Stack Overflow.
I\'m wondering about formal languages. I have a kind of parser : It reads à xml-like serialized tree structure and turn it into a multidimmensionnal array.
If you\'re given a language, how do you figure out if it\'开发者_如何学Cs regular, CF but not regular, or phrase-structure but not CF? Is there a good way to attack this problem? I could randomly try
In Java, constructors cannot be recursive. Compile time error: \"recursive constructor invocation\". Let\'s assume that we did not have this restriction.
I know this isn\'t directly related to programming, but I was wondering if anyone know how to apply the pumping lemma to the following proof:
What is the runtime? And I don\'t mean \"at run time\" = as the program/script is running. I mean The <your-inter开发者_StackOverflow社区preted-language-here> runtimeThat\'s exactly what it mea
加载中,请稍侯......