The following pages link to Wojciech Fraczak (Q293403):
Displayed 20 items.
- A non-SOS operational semantics for a process algebra (Q293405) (← links)
- Prime normal form and equivalence of simple grammars (Q860856) (← links)
- Equivalence of simple functions (Q880171) (← links)
- Computing the throughput of concatenation state machines (Q954952) (← links)
- A characterization of s-languages (Q1029050) (← links)
- Item:Q293403 (redirect page) (← links)
- M-nets: An algebra of high-level Petri-nets, with an application to the semantics of concurrent programming languages (Q1284690) (← links)
- (Q3370007) (← links)
- REDUCING SIMPLE GRAMMARS: EXPONENTIAL AGAINST HIGHLY-POLYNOMIAL TIME IN PRACTICE (Q3503088) (← links)
- Efficient Computation of Throughput Values of Context-Free Languages (Q3503907) (← links)
- Matching Integer Intervals by Minimal Sets of Binary Words with don’t cares (Q3506955) (← links)
- (Q3565913) (← links)
- Equivalence of Functions Represented by Simple Context-Free Grammars with Output (Q3617047) (← links)
- (Q4418601) (← links)
- (Q4808650) (← links)
- A class of composable high level Petri nets (Q5096360) (← links)
- Implementation and Application of Automata (Q5463970) (← links)
- LINEAR-TIME PRIME DECOMPOSITION OF REGULAR PREFIX CODES (Q5696951) (← links)
- Reducing Simple Grammars: Exponential Against Highly-Polynomial Time in Practice (Q5757217) (← links)
- Implementation and Application of Automata (Q5897667) (← links)