pith. sign in

hub

The (generaliz ed) Post correspondence problem with lists consisting of two words is decidable

18 Pith papers cite this work. Polarity classification is still indexing.

18 Pith papers citing it

hub tools

citation-role summary

background 1

citation-polarity summary

roles

background 1

polarities

background 1

representative citing papers

Automatic actions I. Bounded automata and orbits

math.GR · 2026-06-06 · unverdicted · novelty 7.0

For bounded automatic actions of inverse semigroups the orbit relation is ω-regular, making first-order statements about orbits and actions decidable, including computability of Fatou component encodings for post-critically finite polynomials.

On the Complexity of Recurrence Evaluation

cs.CC · 2026-05-31 · unverdicted · novelty 6.0

Establishes PSPACE/EXP-completeness for offset-input recurrence evaluation and PP-hardness for 3D NAND recurrences with coordinate offsets and arbitrary boundaries.

Relation-Algebraic Verification of Disjoint-Set Forests

cs.LO · 2023-01-24 · accept · novelty 6.0

Relation algebras gain semantics for associative arrays that integrate with while-programs, enabling Isabelle/HOL proofs of correctness for disjoint-set forest implementations using union-by-rank and path compression, splitting or halving.

Learning Alternating Real-Time Automata

cs.FL · 2026-06-18 · unverdicted · novelty 5.0

AL*RTA learns alternating real-time automata, terminates, and produces smaller models than NL*RTA at the expense of more queries while preserving expressive power.

Decision Problems on Copying and Shuffling

cs.FL · 2023-02-13 · unverdicted · novelty 4.0

Investigates decidability of existence of words with copy-, marked-copy-, and shuffle-based forms inside regular and linear context-free languages.

citing papers explorer

Showing 18 of 18 citing papers.