The following pages link to Mikołaj Bojańczyk (Q290907):
Displayed 50 items.
- Regular languages of thin trees (Q290908) (← links)
- Nominal monoids (Q372971) (← links)
- Solutions in XML data exchange (Q389225) (← links)
- Finite satisfiability for guarded fixpoint logic (Q436331) (← links)
- Weak MSO with the unbounding quantifier (Q537919) (← links)
- Tree-walking automata cannot be determinized (Q817841) (← links)
- Ramsey's theorem for colors from a metric space (Q1758232) (← links)
- The finite graph problem for two-way alternating automata. (Q1874281) (← links)
- Algebra for trees (Q2074223) (← links)
- A new algorithm for testing if a regular language is locally threshold testable (Q2380003) (← links)
- Characterizing EF and EX tree logics (Q2503041) (← links)
- (Q2769426) (← links)
- Modelling Infinite Structures with Atoms (Q2849420) (← links)
- Automata theory in nominal sets (Q2878750) (← links)
- An extension of data automata that captures XPath (Q2881071) (← links)
- (Q2904801) (← links)
- Wreath Products of Forest Algebras, with Applications to Tree Logics (Q2914240) (← links)
- (Q2920114) (← links)
- Towards nominal computation (Q2942888) (← links)
- Two-variable logic on data words (Q2946646) (← links)
- (Q2957477) (← links)
- (Q2957484) (← links)
- (Q2957916) (← links)
- (Q3086921) (← links)
- (Q3113676) (← links)
- Beyond $\omega$-Regular Languages (Q3113731) (← links)
- Piecewise testable tree languages (Q3166216) (← links)
- A Machine-Independent Characterization of Timed Languages (Q3167002) (← links)
- Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets (Q3167003) (← links)
- Toward Model Theory with Data Values (Q3167004) (← links)
- Algebra for Infinite Forests with an Application to the Temporal Logic EF (Q3184670) (← links)
- Two-Way Unary Temporal Logic over Trees (Q3395100) (← links)
- Containment of Monadic Datalog Programs via Bounded Clique-Width (Q3449494) (← links)
- Recognisable Languages over Monads (Q3451085) (← links)
- Two-variable logic on data trees and XML reasoning (Q3452211) (← links)
- Shuffle Expressions and Words with Nested Data (Q3525617) (← links)
- Tree-Walking Automata (Q3540091) (← links)
- On the Borel Complexity of MSO Definable Sets of Branches (Q3561217) (← links)
- Tree-walking automata do not recognize all regular languages (Q3581424) (← links)
- Efficient Evaluation of Nondeterministic Automata Using Factorization Forests (Q3587404) (← links)
- Reachability in Unions of Commutative Rewriting Systems Is Decidable (Q3590971) (← links)
- Forest Expressions (Q3608410) (← links)
- Expressive Power of Pebble Automata (Q3613757) (← links)
- Tree-Walking Automata Do Not Recognize All Regular Languages (Q3624380) (← links)
- Factorization Forests (Q3637210) (← links)
- (Q4596779) (← links)
- Thin MSO with a Probabilistic Path Quantifier. (Q4598237) (← links)
- It is Undecidable if Two Regular Tree Languages can be Separated by a Deterministic Tree-walking Automaton (Q4601120) (← links)
- (Q4601873) (← links)
- Decomposition theorems and model-checking for the modal <i>μ</i> -calculus (Q4635600) (← links)