#### Filter Results:

- Full text PDF available (16)

#### Publication Year

1968

2017

- This year (6)
- Last 5 years (18)
- Last 10 years (26)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Wojciech Czerwinski, Claire David, Katja Losemann, Wim Martens
- FoSSaCS
- 2013

We investigate the complexity of deciding whether a given regular language can be defined with a deterministic regular expression. Our main technical result shows that the problem is PSPACE-completeâ€¦ (More)

- Wojciech Czerwinski, Sibylle B. FrÃ¶schle, Slawomir Lasota
- CONCUR
- 2009

Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent similarity between theâ€¦ (More)

- Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
- Theory of Computing Systems
- 2011

We investigate normed commutative context-free processes (Basic Parallel Processes). We show that branching bisimilarity admits the bounded response property: in the Bisimulation Game, Duplicatorâ€¦ (More)

- Wojciech Czerwinski, Wim Martens, TomÃ¡s Masopust
- ICALP
- 2013

When can two regular word languages K and L be separated by a simple language? We investigate this question and consider separation by piecewiseand suffix-testable languages and variants thereof. Weâ€¦ (More)

- Wojciech Czerwinski, Slawomir Lasota
- FSTTCS
- 2010

Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5), thus improving the previously knownâ€¦ (More)

Tree pattern queries are being investigated in database theory for more than a decade. They are a fundamental and flexible query mechanism and have been considered in the context of querying treeâ€¦ (More)

This thesis is about an extension of context-free grammars with partial commutation on nonterminal symbols. In particular, we investigate the subclass with transitive dependence relation and theâ€¦ (More)

- Wojciech Czerwinski, Piotr Hofman, Slawomir Lasota
- Logical Methods in Computer Science
- 2012

This paper is about reachability analysis in a restricted subclass of multi-pushdown automata: we assume that the control states of an automaton are partially ordered, and all transitions of anâ€¦ (More)

The separability problem for languages from a class C by languages of a class S asks, for two given word languages I and E from C, whether there exists a language S from S which includes I andâ€¦ (More)

- Wojciech Czerwinski, Sibylle B. FrÃ¶schle, Slawomir Lasota
- Inf. Comput.
- 2011

Article history: Available online 17 December 2010 Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP,â€¦ (More)