Network profile

Hermann Gruber

Reputation

337

2017
2018
2019
2020

Top tag

complexity-theory

Next privilege

500 Rep.

Access review queues

Badges

Newest

Civic Duty

Next badge

0/1

Impact

5 posts edited

1 helpful flag

321 votes cast

19 Bookmarks

Votes Activity Newest Views Added

votes

answer

views

Longest Repeated (Scattered) Subsequence in a String

Apr 29 '19 at 22:03 Throckmorton 905

votes

answer

854

views

Graph problem known to be $NP$-complete only under Cook reduction

complexity-theory graphs np-complete reductions

Jan 29 at 11:34 Hermann Gruber 337

votes

answer

views

Is regex golf NP-Complete?

complexity-theory np-complete regular-expressions

Jan 22 '14 at 0:39 FrankW 6,405

votes

answer

755

views

“Dense” regular expressions generate $\Sigma^*$?

formal-languages regular-languages regular-expressions

Dec 19 '12 at 21:45 Yuval Filmus 232k

votes

answers

views

Do undecidable languages exist in constructivist logic?

formal-languages turing-machines logic proof-techniques undecidability

Sep 29 '16 at 18:00 jmite 27.7k

votes

answers

views

Why are regular expressions defined with union, concatenation and star operations?

formal-languages regular-languages regular-expressions

Jan 30 at 21:21 reinierpost 3,862

votes

answers

641

views

Minimal regular expression that matches a given set of words

optimization regular-expressions strings exact-string-matching

Nov 18 at 16:08 siracusa 295

votes

answers

108

views

Non-deterministic Buchi vs Rabin: Automaton size for LTL->automaton

automata linear-temporal-logic

Mar 17 '17 at 11:43 Perissiane 153

votes

answer

views

Primitive word and cyclic rotations

strings word-combinatorics

Jan 17 at 21:14 Hermann Gruber 337

votes

answers

116

views

Is there a polynomial-time algorithm to minimize regular expressions without Kleene closures/stars?

regular-expressions complexity-classes finite-sets

Sep 23 '19 at 23:58 Patrick87 12.1k

votes

answer

287

views

Who invented the state elimination algorithm for converting finite automata into regular expressions?

reference-request finite-automata regular-expressions

May 22 '15 at 8:58 Hendrik Jan 24k

votes

answer

326

views

What is the complexity of finding a regular expression equivalent to a given DFA?

complexity-theory finite-automata regular-expressions search-problem

Sep 17 '15 at 16:19 Community♦ 1

votes

answer

688

views

Cartesian product of regular expressions?

finite-automata regular-expressions

Mar 7 '18 at 3:53 Yuval Filmus 232k

votes

answer

views

Origin of “Cookie” in Computing?

terminology history

Sep 21 at 20:43 Hermann Gruber 337

votes

answer

views

Why Study Complexity Theory?

complexity-theory asymptotics

Sep 9 at 4:22 D.W.♦ 124k

votes

answers

views

Minimal regular expression from minimal NFA for finite language in polynomial time?

finite-automata regular-expressions nondeterminism finite-sets

Sep 24 '19 at 0:12 Patrick87 12.1k

vote

answer

views

Size, depth, and time of circuits

complexity-theory

Jan 3 at 18:44 D.W.♦ 124k

vote

answer

views

Is every linear language in NL?

complexity-theory context-free space-complexity complexity-classes

Jun 7 at 11:43 frenkie21 13

vote

answers

172

views

Number of non deterministic finite automata that can be constructed for $n$ states and alphabet with $m$ symbols

formal-languages automata finite-automata

Jun 24 '18 at 19:02 anir 1,347

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

19 Bookmarks

Longest Repeated (Scattered) Subsequence in a String

Graph problem known to be $NP$-complete only under Cook reduction

Is regex golf NP-Complete?

“Dense” regular expressions generate $\Sigma^*$?

Do undecidable languages exist in constructivist logic?

Why are regular expressions defined with union, concatenation and star operations?

Minimal regular expression that matches a given set of words

Non-deterministic Buchi vs Rabin: Automaton size for LTL->automaton

Primitive word and cyclic rotations

Is there a polynomial-time algorithm to minimize regular expressions without Kleene closures/stars?

Who invented the state elimination algorithm for converting finite automata into regular expressions?

What is the complexity of finding a regular expression equivalent to a given DFA?

Cartesian product of regular expressions?

Origin of “Cookie” in Computing?

Why Study Complexity Theory?

Minimal regular expression from minimal NFA for finite language in polynomial time?

Size, depth, and time of circuits

Is every linear language in NL?

Number of non deterministic finite automata that can be constructed for $n$ states and alphabet with $m$ symbols