J.-E. Pin's user avatar
J.-E. Pin's user avatar
J.-E. Pin's user avatar
J.-E. Pin
  • Member for 10 years, 8 months
  • Last seen this week
  • Paris
21 votes

How to create DFA from regular expression without using NFA?

15 votes

Star free language vs. regular language

13 votes
Accepted

Bridge theorems for group theory and formal languages

13 votes

NFA with exponential number of states when determinized

13 votes

Algorithm to test whether a language is regular

13 votes

Importance of the empty string

12 votes

How to prove a language is regular?

12 votes

Can we make a non-regular language regular via concatentation?

9 votes

When is the concatenation of two regular languages unambiguous?

9 votes

Decidability of "Is this regular expression prefix-free?"

8 votes

DFA for accepting all binary strings of form power of $n$ (not divisible by $n$) i.e. $n^k$ for given $n$

7 votes
Accepted

Abstract algebra and programming languages

7 votes
Accepted

Characterising $(aa)^*$ in first order logic

7 votes

Are regular languages closed under inverse homomorphism?

6 votes

Designing a DFA that accepts strings such that nth character from last satisfies condition

6 votes

Proof that the regular languages are closed under string homomorphism

6 votes
Accepted

Minimize Deterministic Finite Automata with no accepting states

6 votes

Deciding if a finite automata accepts strings of any length

6 votes
Accepted

Regular Grammar and Regular Language

6 votes

Myhill-Nerode style characterization of CFL?

6 votes

Are there well-specified formal languages that are not regular?

6 votes
Accepted

What is the origin of using Q to denote a set of states in an automaton?

6 votes

Data compression using prime numbers

6 votes
Accepted

Why is the number of states for DFA is 3n + 1 for this language

5 votes
Accepted

Inverse Homomorphisms and Kleene star

5 votes
Accepted

Brzozowski algebraic method for NFA

5 votes
Accepted

How to prove for that a given non-regular language its given super-set is also non-regular?

5 votes
Accepted

What do you call a function from symbols of alphabet to languages?

5 votes

How do I verify that a DFA is equivalent to a NFA?

5 votes

Formal languages: constructing * for a linear set

1
2 3 4 5