pith. sign in

This impliesq 4 =q ′ 3 andq 5 =q ′

Additionally, from the configuration⟨q 0, ε⟩, the recursive run onccmust be unique, therefore⟨q 2, q4 ·q 5⟩=⟨q ′ 2, q′ 3 ·q ′ 5⟩

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.FL 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Visibly Recursive Automata

cs.FL · 2026-03-12 · unverdicted · novelty 7.0

Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.

citing papers explorer

Showing 1 of 1 citing paper.

  • Visibly Recursive Automata cs.FL · 2026-03-12 · unverdicted · none · ref 35

    Visibly recursive automata extend procedural automata and use codeterminism to achieve efficient complementation and other desirable algorithmic properties.