User Hermann Gruber

29

votes

2

answers

2k

views

Longest Repeated (Scattered) Subsequence in a String

Oct 4 at 9:23 pcpthm 96

29

votes

1

answer

875

views

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

complexity-theory graphs np-complete reductions

Jan 29 '20 at 11:34 Hermann Gruber 357

29

votes

11

answers

4k

views

Unusual applications of regular expressions?

regular-expressions

May 9 at 8:26 Michael Zedeler 121

28

votes

1

answer

2k

views

Is regex golf NP-Complete?

complexity-theory np-complete regular-expressions

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

26

votes

1

answer

775

views

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

formal-languages regular-languages regular-expressions

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

24

votes

4

answers

1k

views

Do undecidable languages exist in constructivist logic?

formal-languages turing-machines logic proof-techniques undecidability

Sep 29 '16 at 18:00 jmite 28.2k

11

votes

3

answers

2k

views

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

formal-languages regular-languages regular-expressions

Jan 30 '20 at 21:21 reinierpost 4,015

7

votes

1

answer

154

views

Non-deterministic Büchi vs Rabin: Automaton size for LTL->automaton

automata linear-temporal-logic

Dec 31 at 23:27 D.W.♦ 129k

6

votes

0

answers

699

views

Minimal regular expression that matches a given set of words

optimization regular-expressions strings exact-string-matching

Nov 18 '19 at 16:08 siracusa 305

5

votes

0

answers

122

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.3k

5

votes

1

answer

292

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 24.7k

5

votes

1

answer

354

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

5

votes

1

answer

96

views

Primitive word and cyclic rotations

strings word-combinatorics

Jan 17 '20 at 21:14 Hermann Gruber 357

4

votes

1

answer

780

views

Cartesian product of regular expressions?

finite-automata regular-expressions

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

4

votes

1

answer

2k

views

Proving that the scramble of a regular language is context-free

formal-languages regular-languages context-free

Apr 7 '16 at 0:18 Vim 143

4

votes

1

answer

101

views

Origin of “Cookie” in Computing?

terminology history

Sep 21 at 20:43 Hermann Gruber 357

3

votes

1

answer

116

views

Why Study Complexity Theory?

complexity-theory asymptotics

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

3

votes

0

answers

53

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.3k

1

vote

1

answer

34

views

Size, depth, and time of circuits

complexity-theory

Jan 3 '20 at 18:44 D.W.♦ 129k

1

vote

1

answer

88

views

Is every linear language in NL?

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

Jun 7 at 11:43 frenkie21 13

1

vote

0

answers

223

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,417

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

21 Bookmarks

Longest Repeated (Scattered) Subsequence in a String

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

Unusual applications of regular expressions?

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?

Non-deterministic Büchi vs Rabin: Automaton size for LTL->automaton

Minimal regular expression that matches a given set of words

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?

Primitive word and cyclic rotations

Cartesian product of regular expressions?

Proving that the scramble of a regular language is context-free

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