I was just shocked when I saw these consecutive outcomes of an L-system converging to the Sierpinski triangle (shown in the picture below). I'm interested to know how could one a …

Any grammar for the language $$L =a^p,\text{ $p$ is prime and }p\in \mathbb{N}?$$ Is such a grammar related to any question of number theory like RH or the conjecture of twin prim …

How to work out a grammar if we know the language? Or at least How to work out a grammar if we know the language that is restricted to a special kind like CFL or CSL? For example,w …

It is well known that the generating function of a regular language $L$, i.e. $\sum n_kz^k$ where $n_k$ is the number of words of length $k$ in $L$, is rational, i.e. a quotient of …

Is any CFL intersection,union of CFLs that are not inherently ambiguous?

Given two NFW $A$ and $B$, we regarded $A$ and $B$ as Büchi automata. We can show that the containment property is not preserved in Büchi automata. That is, we can construct a exa …

formal language and automata theory regular expessions (a+b)* =a*(ba*)* please answer I want the proof thank you

Let FOL[<,R] be the fragment of first-order logic enriched with two relational symbols < and R and the first-order axioms that say: < is a strict partial order and R is a …

Say that "U" is the axiom that "For each set x, there exists a Grothendieck universe U such that x $\in$ U", where Grothendieck universes are defined in the usual way (or, if that' …

Given two regular expressions $R$ and $S$ on an alphabet $\Sigma$ it is possible to decide their equivalence as follows: build two finite automata $M_R$ and $M_S$ such that $L(R) …

Mathematics has undergone some rather nice developments recently with the adoption of new techologies, things like on-line journals, the arXiv, this website, etc. I imagine there …

Dear All, there is one type of regular languages, over ${a,b}$, which appear naturally in what I am studying, so if anybody could recognise them, or say any sort of their characte …

This is primarily a question about related literature. I am looking for specific references, or terminology that I can use to search for references. Let A a well defined mathemati …

Call a higher-order logic fully monadic if and only if all of its predicate constants (at any order) and higher-order variables (at any order) are monadic (and it has no function s …

Is complement of LL(k) grammar context free?