user avatar
user avatar
user avatar
Andreas T
  • Member for 9 years, 5 months
  • Last seen more than a month ago
1 vote
Accepted

Counterexample for simple parity automaton reduction

1 vote
Accepted

Language equivalent states in a deterministic parity automaton

4 votes
Accepted

Is this decidable language a subset of this undecidable language?

1 vote
Accepted

How to prove LTL-formulas true for all paths?

2 votes
Accepted

How to find time complexity for functions in lazy functional languages?

3 votes
Accepted

What Does The Notation of Union Over K represent?

0 votes
Accepted

Can minimum or maximum height of the binary search tree be constrained by the position of some elements

5 votes
Accepted

Summation of a Random Variable

2 votes
Accepted

Logical Reduction

2 votes
Accepted

Big Omega Counterexample?

0 votes

Constructing Turing machines

0 votes

Relation between sets and partially computable functions