The following pages link to Mikołaj Bojańczyk (Q290907):
Displaying 41 items.
- Star Height via Games (Q4635805) (← links)
- Definability equals recognizability for graphs of bounded treewidth (Q4635898) (← links)
- (Q4636613) (← links)
- (Q4737212) (← links)
- Fraenkel-Mostowski Sets with Non-homogeneous Atoms (Q4899138) (← links)
- (Q5028484) (← links)
- (Q5089180) (← links)
- (Q5091268) (← links)
- Orbit-finite sets and their algorithms (Q5111332) (← links)
- (Q5111438) (← links)
- (Q5111446) (← links)
- Regular and First-Order List Functions (Q5145284) (← links)
- Definable decompositions for graphs of bounded linear cliquewidth (Q5145285) (← links)
- On computability and tractability for infinite sets (Q5145286) (← links)
- First-order tree-to-tree functions (Q5145635) (← links)
- Extensions of ω-Regular Languages (Q5145637) (← links)
- Transducers with Origin Information (Q5167824) (← links)
- Weak MSO+U with Path Quantifiers over Infinite Trees (Q5167825) (← links)
- On the Decidability of MSO+U on Infinite Trees (Q5167826) (← links)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science (Q5191506) (← links)
- (Q5207048) (← links)
- (Q5216303) (← links)
- (Q5216326) (← links)
- Regular tree languages in low levels of the Wadge hierarchy (Q5232909) (← links)
- Turing Machines with Atoms (Q5271055) (← links)
- Computer Science Logic (Q5311284) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311502) (← links)
- Weak MSO with the Unbounding Quantifier (Q5389974) (← links)
- XPath evaluation in linear time (Q5395662) (← links)
- Bounded Depth Data Trees (Q5428865) (← links)
- The Common Fragment of ACTL and LTL (Q5458358) (← links)
- Automata, Languages and Programming (Q5466466) (← links)
- Rigidity is undecidable (Q5740405) (← links)
- (Q5856407) (← links)
- Tree Languages Defined in First-Order Logic with One Quantifier Alternation (Q5894002) (← links)
- Function spaces for orbit-finite sets (Q6529622) (← links)
- Orbit-finite-dimensional vector spaces and weighted register automata (Q6566474) (← links)
- Monadic monadic second order logic (Q6612795) (← links)
- Algebraic recognition of regular functions (Q6638126) (← links)
- Transducers of polynomial growth (Q6649429) (← links)
- MSO+\( \nabla \) is undecidable (Q6654526) (← links)
