BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × United Kingdom
2 × USA
Collaborated with:
D.E.Muller A.Saoudi D.Perrin
Talks about:
automata (4) theori (2) altern (2) monad (2) logic (2) decid (2) weak (2) distinguish (1) exponenti (1) reachabl (1)

Person: Paul E. Schupp

DBLP DBLP: Schupp:Paul_E=

Contributed to:

LICS 19881988
ICALP 19861986
LICS 19861986
STOC 19811981

Wrote 4 papers:

LICS-1988-MullerSS #automaton #decidability #exponential #logic #why
Weak Alternating Automata Give a Simple Explanation of Why Most Temporal and Dynamic Logics are Decidable in Exponential Time (DEM, AS, PES), pp. 422–427.
ICALP-1986-MullerSS #automaton #complexity #monad
Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity (DEM, AS, PES), pp. 275–283.
LICS-1986-PerrinS #automaton #decidability #equivalence #integer #monad
Automata on the Integers, Recurrence Distinguishability, and the Equivalence and Decidability of Monadic Theories (DP, PES), pp. 301–304.
STOC-1981-MullerS #automaton #graph #higher-order #logic #problem #reachability
Pushdown Automata, Graphs, Ends, Second-Order Logic, and Reachability Problems (DEM, PES), pp. 46–54.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.