Prove that this language is undecidable...

Is the complement of any context free language context free?...

How to write a concise regular expression for all strings containing "a"s, "b"s,...

Is JavaScript a Context Free Language?...

Correct use of array brackets...

stack translator in formal languages...

Z into Isabelle...

How to determine if a context-free grammar describes a regular language?...

MS Word Equation Accent with Dots...

Trying to generate all sentences of a simple formal grammar...

chomsky hierarchy and programming languages...

Example of Non-Linear, UnAmbiguous and Non-Deterministic CFL?...

Solving a first-follow conflict in a grammar...

Are regular haskell algebraic data types equivalent to context free grammars? What about GADTS?...

Can the intersection of 2 non-regular languages be a regular language?...

Writing a formal language parser with Lisp...

Language generated by a Context Free Grammar?...

When is the Kleene star of a finite language free?...

can the language 0^n1^n be expressed as a regular grammar?...

P is undecidable and not semidecidable, Q is undecidable and semidecidable and P ⊂ Q...

Finding context-free grammar...

What does opposite angle brackets <> mean?...

Predefined Set in Alloy...

Formal Methods, Logic and VDM past exam paper questions...

Mildly Context sensitive Grammars...

What would be the language generated by Σ*-x?...

Construction of a context free grammar...

How to define at least one occurrence of a string between two tokens in a CUP parser grammar...

Formal methods - Map of price relating cars to price with two sets BL and Fiat...

C and Turing Machines...