E-LIB Suche - Ergebnisse für: Schnoebelen, Ph.

1

On the Piecewise Complexity of Words and Periodic Words:

, In: Lecture Notes in Computer Science; SOFSEM 2024: Theory and Practice of Computer Science,

Praveen, M. ; Schnoebelen, Ph. ; Veron, J.. - p. 456-470 , 2024

Link: https://doi.org/10.1007/..

2

Algebraic and Logic Programming

Proceedings of an International Workshop held in Gaussig (G... Mathematical Research ; 49, Mathematische Forschung

Beierle, Christoph ; Bergstra, J.A ; Bockmayr, Alexander... - Reprint 2022 . , [2022]

Link: https://doi.org/10.1515/..

3

On shuffle products, acyclic automata and piecewise-testabl..:

Halfon, S. ; Schnoebelen, Ph.
Information Processing Letters. 145 (2019) - p. 68-73 , 2019

Link: https://doi.org/10.1016/..

4

On the state complexity of closures and interiors of regula..:

Karandikar, P. ; Niewerth, M. ; Schnoebelen, Ph.
Theoretical Computer Science. 610 (2016) - p. 91-107 , 2016

Link: https://doi.org/10.1016/..

5

On the index of Simon's congruence for piecewise testabilit:

Karandikar, P. ; Kufleitner, M. ; Schnoebelen, Ph.
Information Processing Letters. 115 (2015) 4 - p. 515-519 , 2015

Link: https://doi.org/10.1016/..

6

A parametric analysis of the state-explosion problem in mod..:

Demri, S. ; Laroussinie, F. ; Schnoebelen, Ph.
Journal of Computer and System Sciences. 72 (2006) 4 - p. 547-575 , 2006

Link: https://doi.org/10.1016/..

7

Efficient timed model checking for discrete-time systems:

Laroussinie, F. ; Markey, N. ; Schnoebelen, Ph.
Theoretical Computer Science. 353 (2006) 1-3 - p. 249-271 , 2006

Link: https://doi.org/10.1016/..

8

Verification of probabilistic systems with faulty communica..:

Abdulla, P.A. ; Bertrand, N. ; Rabinovich, A..
Information and Computation. 202 (2005) 2 - p. 141-165 , 2005

Link: https://doi.org/10.1016/..

9

Preface:

Schnoebelen, Ph
Electronic Notes in Theoretical Computer Science. 98 (2004) - p. 1 , 2004

Link: https://doi.org/10.1016/..

10

A PTIME-complete matching problem for SLP-compressed words:

Markey, N. ; Schnoebelen, Ph.
Information Processing Letters. 90 (2004) 1 - p. 3-6 , 2004

Link: https://doi.org/10.1016/..

11

On the expressivity and complexity of quantitative branchin..:

Laroussinie, F. ; Schnoebelen, Ph. ; Turuani, M.
Theoretical Computer Science. 297 (2003) 1-3 - p. 297-315 , 2003

Link: https://doi.org/10.1016/..

12

An Automata-Theoretic Approach to the Reachability Analysis..:

Labroue, A. ; Schnoebelen, Ph.
Electronic Notes in Theoretical Computer Science. 52 (2002) 1 - p. 1-20 , 2002

Link: https://doi.org/10.1016/..

13

The regular viewpoint on PA-processes:

Lugiez, D. ; Schnoebelen, Ph.
Theoretical Computer Science. 274 (2002) 1-2 - p. 89-115 , 2002

Link: https://doi.org/10.1016/..

14

Verifying lossy channel systems has nonprimitive recursive ..:

Schnoebelen, Ph.
Information Processing Letters. 83 (2002) 5 - p. 251-261 , 2002

Link: https://doi.org/10.1016/..

15

Well-structured transition systems everywhere!:

Finkel, A. ; Schnoebelen, Ph.
Theoretical Computer Science. 256 (2001) 1-2 - p. 63-92 , 2001

Link: https://doi.org/10.1016/..