rici's user avatar
rici's user avatar
rici's user avatar
rici
  • Member for 11 years, 1 month
  • Last seen more than 1 year ago
  • Peru
7 votes

Maximum number of path for acyclic graph with start and end node

4 votes
Accepted

square-free word

3 votes
Accepted

How does the following Non Deterministic Automata accept the language A every time?

3 votes

Do lookahead and lookbehind in regex come from some type of formal languages?

3 votes
Accepted

Describe the language of $S\to0S0\,\,|\,\,1S0\,\,|\,\,\varepsilon$

2 votes
Accepted

Is $L_2=\{w^*\,:\,w\in L_1\}$ where $L_1$ is regular, a regular language?

2 votes

If $L_1L_2$ is regular language, is $L_2L_1$ regular as well?

2 votes
Accepted

Can we find grammar for every CFL without $ε $ with these productions

2 votes

Is $L = \{ a^p : \text{$p$ is prime} \}$ a context-sensitive language?

2 votes
Accepted

CFG: Translate English sentence to math basic logic

2 votes

If $𝐿$ is regular, will $L' = \{v\in L:\,\exists w\in L: w = v^R\}$ be regular also?

2 votes
Accepted

CFG for $a^ib^jc^k : j <= i + k$

2 votes
Accepted

“Two-dimensional” Catalan numbers?

2 votes
Accepted

How to connect DFA state which had no transitions after minimizing it?

2 votes

How many essentially different strings are there of length $\leq n$ and over an alphabet of size $|\Sigma| = m$?

1 vote

Describing $\max(L)$ using a regular expression - proper prefix

1 vote
Accepted

Adding trigonometric operations and other operations to context free grammar

1 vote

What would be the complement of $L =\{a^{n}b^{m}a^{n}b^{m} | n,m \geq 1\}$

1 vote
Accepted

On left recursive context-free grammars

1 vote
Accepted

If $R^*(R+S)\equiv S^*(R+S)$, then $R^*\equiv S^*$

1 vote

Proof that $\textit{INFINITE}_{\text{DFA}}$ is decidable.(Sipser Q.4.10)

1 vote

Expected number of 1s for a random integer

1 vote

Is this language Regular or non regular

1 vote

Regular expressions match not "abc"

1 vote

Automata q0 ∈ F but no transitions to itself.

1 vote
Accepted

Which symbols in the following grammar $G$ are generating?

1 vote

Are programming languages generally CFLs or deterministic CFLs?

1 vote
Accepted

What are the critera for a family of languages to qualify as a type of language in Chomsky hierarchy?

1 vote

derived tree from cfg

1 vote

Give a grammar complement to a non-CFL language