Newbetuts
.
New posts in formal-languages
Find a short expression for a given large integer
number-theory
prime-numbers
formal-languages
Substitution in sequent calculus vs substitution in lambda calculus
logic
formal-languages
substitution
lambda-calculus
sequent-calculus
Does there exist a universal pushdown automaton?
computability
formal-languages
automata
Need help to write a proof regarding first order formula
propositional-calculus
first-order-logic
formal-languages
computational-mathematics
Context-sensitive grammar for the copy language
formal-languages
formal-grammar
What is the difference between language of empty string and empty set language?
formal-languages
In what sense is $\sf ZFC$ "stronger" than Peano arithmetic?
logic
model-theory
formal-languages
provability
What's the point of allowing only quantification of variables in first-order logic.
first-order-logic
formal-languages
Application of Pumping lemma for regular languages
formal-languages
regular-language
Has this algebraic structure been named or studied?
abstract-algebra
terminology
formal-languages
What kind of formal languages can modern regex engines parse?
regex
computer-science
formal-languages
How to prevent duplications when generating strings from context free grammar
python
context-free-grammar
formal-languages
automata-theory
How to create a grammar for complement of $a^nb^n$?
formal-languages
context-free-grammar
Prove that the language $\{bin(p) \mid p\ \text{is prime}\}$ is not regular (prime numbers)
formal-languages
regular-language
A computer's memory is finite, so how can there be languages more powerful than regular?
computational-complexity
computability
formal-languages
context-free-grammar
regular-language
What is the difference between a shuffle and a permutation?
formal-languages
turing-machines
Generating functions for context-free languages
combinatorics
generating-functions
formal-languages
context-free-grammar
Tips for creating "Context Free Grammar"
grammar
context-free-grammar
lexical-analysis
formal-languages
Words built from $\{0,1,2\}$ with restrictions which are not so easy to accomodate.
combinatorics
generating-functions
formal-languages
An analog of the Myhill-Nerode Theorem for context-free languages?
computer-science
formal-languages
Prev
Next