The following pages link to Vesa Halava (Q287018):
Displayed 50 items.
- (Q197714) (redirect page) (← links)
- On a geometric problem of zigzags. (Q287020) (← links)
- New proof for the undecidability of the circular PCP (Q378203) (← links)
- On the \(n\)-permutation Post correspondence problem (Q496055) (← links)
- Decidability without mathematics (Q598296) (← links)
- Existential and positive theories of equations in graph products (Q705067) (← links)
- Undecidability in matrices over Laurent polynomials. (Q705234) (← links)
- Integer weighted automata on infinite words (Q832935) (← links)
- The structure of infinite solutions of marked and binary Post correspondence problems (Q866910) (← links)
- Post correspondence problem for short words (Q975420) (← links)
- Square-free partial words (Q975472) (← links)
- Overlap-freeness in infinite partial words (Q1006076) (← links)
- Equality sets of prefix morphisms and regular star languages (Q1041740) (← links)
- Decidability of the binary infinite Post Correspondence Problem (Q1408462) (← links)
- Binary (generalized) Post Correspondence Problem (Q1605309) (← links)
- On fixed points of rational transductions (Q1637233) (← links)
- Walks on tilings of polygons (Q1682861) (← links)
- Topology and ambiguity in \(\omega\)-context free languages (Q1781923) (← links)
- Lyndon morphisms (Q1781929) (← links)
- Periods and binary words (Q1971621) (← links)
- Weighted automata on infinite words in the context of attacker-defender games (Q2013554) (← links)
- Word problem for deterministic and reversible semi-Thue systems (Q2247995) (← links)
- On Post correspondence problem for letter monotonic languages (Q2271434) (← links)
- Extension of the decidability of the marked PCP to instances with unique blocks (Q2373757) (← links)
- On Markov's undecidability theorem for integer matrices. (Q2460065) (← links)
- Relational codes of words (Q2465641) (← links)
- Defect theorems with compatibility relations. (Q2480767) (← links)
- Positivity of second order linear recurrent sequences (Q2489940) (← links)
- Improved matrix pair undecidability results (Q2641877) (← links)
- GENERALIZED POST CORRESPONDENCE PROBLEM FOR MARKED MORPHISMS (Q2709980) (← links)
- (Q2729239) (← links)
- Mortality in Matrix Semigroups (Q2764742) (← links)
- A new proof for the decidability of D0L ultimate periodicity (Q2789524) (← links)
- On Robot Games of Degree Two (Q2799175) (← links)
- Deterministic Semi-Thue Systems and Variants of Post Correspondence Problem (Q2849972) (← links)
- UNDECIDABILITY BOUNDS FOR INTEGER MATRICES USING CLAUS INSTANCES (Q3065609) (← links)
- REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM (Q3086251) (← links)
- Weighted Automata on Infinite Words in the Context of Attacker-Defender Games (Q3195698) (← links)
- (Q3396566) (← links)
- (Q3409982) (← links)
- Undecidability of infinite post correspondence problem for instances of Size 9 (Q3423136) (← links)
- On the Periodicity of Morphic Words (Q3584894) (← links)
- On the Joint Spectral Radius for Bounded Matrix Languages (Q3584963) (← links)
- MATRIX EQUATIONS AND HILBERT'S TENTH PROBLEM (Q3601323) (← links)
- The theorem of Fine and Wilf for relational periods (Q3625689) (← links)
- (Q4251052) (← links)
- Undecidability of the equivalence of finite substitutions on regular language (Q4265533) (← links)
- (Q4265634) (← links)
- (Q4453473) (← links)
- (Q4510798) (← links)