The following pages link to Filip Mazowiecki (Q1622947):
Displaying 35 items.
- Weak cost register automata are still powerful (Q1622948) (← links)
- Copyless cost-register automata: structure, expressiveness, and closure properties (Q1740663) (← links)
- Dynamic data structures for timed automata acceptance (Q2093569) (← links)
- A robust class of linear recurrence sequences (Q2105454) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- Monadic Datalog and Regular Tree Pattern Queries (Q2922036) (← links)
- Eliminating Recursion from Monadic Datalog Programs on Trees (Q2946356) (← links)
- (Q3304149) (← links)
- Copyless Cost-Register Automata: Structure, Expressiveness, and Closure Properties (Q4601905) (← links)
- Decidability of weak logics with deterministic transitive closure (Q4635613) (← links)
- Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems (Q4972152) (← links)
- (Q5002806) (← links)
- (Q5009428) (← links)
- Monadic Datalog and Regular Tree Pattern Queries (Q5012565) (← links)
- The Reachability Problem for Petri Nets Is Not Elementary (Q5056399) (← links)
- (Q5089315) (← links)
- Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One (Q5111451) (← links)
- (Q5144629) (← links)
- (Q5155662) (← links)
- (Q5155668) (← links)
- The reachability problem for Petri nets is not elementary (Q5212744) (← links)
- Complexity of Two-Variable Logic on Finite Trees (Q5278193) (← links)
- Complexity of Two-Variable Logic on Finite Trees (Q5327424) (← links)
- Maximal Partition Logic: Towards a Logical Characterization of Copyless Cost Register Automata (Q5351955) (← links)
- Weak Cost Register Automata are Still Powerful (Q5859644) (← links)
- (Q5874194) (← links)
- (Q5875390) (← links)
- Continuous One-counter Automata (Q5875944) (← links)
- (Q6192488) (← links)
- Fast termination and workflow nets (Q6535631) (← links)
- On polynomial recursive sequences (Q6614607) (← links)
- On rational recursive sequences (Q6615128) (← links)
- Coverability in VASS revisited: improving Rackoff's bound to obtain conditional optimality (Q6638141) (← links)
- The boundedness and zero isolation problems for weighted automata over nonnegative rationals (Q6649444) (← links)
- The complexity of soundness in workflow nets (Q6649450) (← links)
