MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

Alberto

105

Reputation

45 views

Registered User

Name	Alberto
Member for	11 months
Seen	Nov 26 at 10:55
Website
Location	Italy
Age

stats recent reputation favorites

3

Questions

votes newest views recent

1

4

votes

3

answers

222

views

Existential quantification over regular predicates

lo.logic computer-science computability-theory formal-languages

may 31 at 11:00 Sam Nead 5,637●12●27

3

4

votes

1

answer

274

views

Deciding equivalence of regular languages

lo.logic formal-languages automata-theory computer-science computability-theory

sep 12 at 0:20 Benjamin Steinberg 10.8k●1●14●49

1

vote

3

answers

220

views

Satisfiability problem for FOL[<,R]

lo.logic computability-theory computer-science formal-languages

jan 4 at 18:16 s n 11

2

Answers

Existential quantification over regular predicates

Theory mainly concerned with $\lambda$-calculus?

4

Votes

4

7

Tags

lo.logic× 4
formal-languages× 3
computer-science× 3
computability-theory× 3
automata-theory× 2
soft-question
lambda-calculus

4

Badges