Bartosz Bednarczyk's user avatar
Bartosz Bednarczyk's user avatar
Bartosz Bednarczyk's user avatar
Bartosz Bednarczyk
  • Member for 8 years, 7 months
  • Last seen this week
10 votes
1 answer
320 views

The complexity of conversion from a regular expression to a nondeterminsitic automata and back after changing initial and final states

8 votes
1 answer
497 views

Complexity of modal logic IK5

7 votes
1 answer
428 views

Uniform mortality problem for Turing Machines

7 votes
1 answer
385 views

For a given binary-search tree obtain an isomorphic splay tree

7 votes
1 answer
252 views

Are regular expressions polynomially decomposable?

6 votes
1 answer
261 views

What is the impact of encodings of sparse structures on the complexity of the model checking problem?

5 votes
2 answers
221 views

Reference request: An algebraic characterisation of LTL[XF]-definable word languages

2 votes
0 answers
174 views

Order-invariant conjunctive queries are FO-definable without the order