pith. sign in

Title resolution pending

Achim Blumensath, Erich Grädel, Automatic structures, 15th Annual IEEE Symposium on Logic in Computer Science (Santa Barbara, CA · 2000 · arXiv 2000.855755

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

2 Pith papers citing it
read on arXiv browse 2 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.LO 1 math.GR 1

years

2026 2

verdicts

UNVERDICTED 2

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.

Automatic constraint satisfaction problem

cs.LO · 2026-04-21 · unverdicted · novelty 7.0

AutCSPs allow polynomial-time polymorphism verification and extend Schaefer's dichotomy to Boolean domains with tractability decision procedures for automatic polymorphisms on succinct automata representations.

citing papers explorer

Showing 2 of 2 citing papers.

  • Automatic actions I. Bounded automata and orbits math.GR · 2026-06-06 · unverdicted · none · ref 11

    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.

  • Automatic constraint satisfaction problem cs.LO · 2026-04-21 · unverdicted · none · ref 6

    AutCSPs allow polynomial-time polymorphism verification and extend Schaefer's dichotomy to Boolean domains with tractability decision procedures for automatic polymorphisms on succinct automata representations.