default search action

combined dblp search
author search
venue search
publication search

ask others

Stefan Repke

Stefan Schulz 0002

> Home > Persons

Person information

affiliation (former): RWTH Aachen University, Germany

Other persons with the same name

see FAQ

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2014
[b1]
- view
  authority control:
- export record
  dblp key:
  - phd/dnb/Repke14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/phd/dnb/Repke14
Stefan Repke:
Simplification problems for automata and games. RWTH Aachen University, 2014, pp. 1-93
2013
[c3]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/LodingR13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/LodingR13
Christof Löding, Stefan Repke:
Decidability Results on the Existence of Lookahead Delegators for NFA. FSTTCS 2013: 327-338
2012
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/mfcs/LodingR12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/LodingR12
Christof Löding, Stefan Repke:
Regularity Problems for Weak Pushdown ω-Automata and Games. MFCS 2012: 764-776
2010
[c1]
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - conf/fsttcs/Schulz10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/Schulz10
Stefan Schulz:
First-Order Logic with Reachability Predicates on Infinite Systems. FSTTCS 2010: 493-504

Coauthor Index

see FAQ

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.