2008 |
22 | EE | Wojciech Fraczak,
Wojciech Rytter,
Mohammadreza Yazdani:
Matching Integer Intervals by Minimal Sets of Binary Words with don't cares.
CPM 2008: 217-229 |
21 | EE | Jurek Czyzowicz,
Wojciech Fraczak,
Mohammadreza Yazdani:
Computing the throughput of Concatenation State Machines.
J. Discrete Algorithms 6(1): 28-36 (2008) |
2007 |
20 | EE | Didier Caucal,
Jurek Czyzowicz,
Wojciech Fraczak,
Wojciech Rytter:
Efficient Computation of Throughput Values of Context-Free Languages.
CIAA 2007: 203-213 |
19 | EE | Cédric Bastien,
Jurek Czyzowicz,
Wojciech Fraczak,
Wojciech Rytter:
Reducing Simple Grammars: Exponential against Highly-Polynomial Time in Practice.
Int. J. Found. Comput. Sci. 18(4): 715-725 (2007) |
18 | EE | Cédric Bastien,
Jurek Czyzowicz,
Wojciech Fraczak,
Wojciech Rytter:
Equivalence of simple functions.
Theor. Comput. Sci. 376(1-2): 42-51 (2007) |
2006 |
17 | EE | Cédric Bastien,
Jurek Czyzowicz,
Wojciech Fraczak,
Wojciech Rytter:
Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice.
CIAA 2006: 90-101 |
16 | EE | Cédric Bastien,
Jurek Czyzowicz,
Wojciech Fraczak,
Wojciech Rytter:
Equivalence of Functions Represented by Simple Context-Free Grammars with Output.
Developments in Language Theory 2006: 71-82 |
15 | EE | Mohammadreza Yazdani,
Wojciech Fraczak,
Feliks J. Welfeld,
Ioannis Lambadaris:
A Criterion for Speed Evaluation of Content Inspection Engines.
ICN/ICONS/MCL 2006: 19 |
14 | EE | Mohammadreza Yazdani,
Wojciech Fraczak,
Feliks J. Welfeld,
Ioannis Lambadaris:
Two Level State Machine Architecture for Content Inspection Engines.
INFOCOM 2006 |
13 | EE | Cédric Bastien,
Jurek Czyzowicz,
Wojciech Fraczak,
Wojciech Rytter:
Prime normal form and equivalence of simple grammars.
Theor. Comput. Sci. 363(2): 124-134 (2006) |
2005 |
12 | EE | Cédric Bastien,
Jurek Czyzowicz,
Wojciech Fraczak,
Wojciech Rytter:
Prime Normal Form and Equivalence of Simple Grammars.
CIAA 2005: 78-89 |
11 | | Jurek Czyzowicz,
Wojciech Fraczak,
Andrzej Pelc:
Transducers with Set Output.
Journal of Automata, Languages and Combinatorics 10(1): 37-49 (2005) |
2004 |
10 | EE | Wojciech Debski,
Wojciech Fraczak:
Concatenation State Machines and Simple Functions.
CIAA 2004: 113-124 |
9 | EE | Wojciech Fraczak,
Anna Podolak:
A characterization of s-languages.
Inf. Process. Lett. 89(2): 65-70 (2004) |
2003 |
8 | EE | Jurek Czyzowicz,
Wojciech Fraczak,
Andrzej Pelc,
Wojciech Rytter:
Linear-Time Prime Decomposition Of Regular Prefix Codes.
Int. J. Found. Comput. Sci. 14(6): 1019-1032 (2003) |
2002 |
7 | EE | Jurek Czyzowicz,
Wojciech Fraczak,
Andrzej Pelc,
Wojciech Rytter:
Prime Decompositions of Regular Prefix Codes.
CIAA 2002: 85-94 |
6 | EE | Jurek Czyzowicz,
Wojciech Fraczak,
Andrzej Pelc:
Transducers with Set Output.
COCOON 2002: 300-309 |
1998 |
5 | EE | Eike Best,
Wojciech Fraczak,
Richard P. Hopkins,
Hanna Klaudel,
Elisabeth Pelz:
M-Nets: An Algebra of High-Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages.
Acta Inf. 35(10): 813-857 (1998) |
4 | EE | Wojciech Fraczak,
Marek B. Zaremba:
A Non-SOS Operational Semantics for a Process Algebra.
Inf. Process. Lett. 68(1): 47-54 (1998) |
1997 |
3 | | Wojciech Fraczak,
Elisabeth Pelz:
Improved Implementations via a New Structural Equivalence on Labelled Nets.
ICATPN 1997: 117-135 |
1995 |
2 | | Wojciech Fraczak:
Multi-Action Process Algebra.
ASIAN 1995: 126-140 |
1 | | Eike Best,
Hans Fleischhack,
Wojciech Fraczak,
Richard P. Hopkins,
Hanna Klaudel,
Elisabeth Pelz:
A Class of Composable High Level Petri Nets with an Application to the Semantics of B(PN)2.
Application and Theory of Petri Nets 1995: 103-120 |