Paper Citation Record · LEDGER

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter

As of 18 August 2026, this Paper Citation Record lists 46 of 46 outbound references and 1 inbound Pith citation observation for arXiv:2505.13749.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2505.13749 v1

Coverage vector

measured 46 of 46 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-15T20:27:49.626305Z

measured 47 of 47 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-18T06:34:40.430872+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-03T15:05:07.621759Z

measured 1 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-05T02:28:24.338817Z

Reference resolution

46 of 46 outbound references displayed

verified exact4
verified fuzzy24
unresolved13
parse uncertain3
malformed identifier2
metadata mismatch0

External citation measurements

0
pith, observed 2026-08-05T02:28:24.338817Z

Outbound references

Observation 52229a93-4789-4d2d-b3c1-c2378f535f72 · outbound

This paper cites Algorithmic Analysis of Programs with Well Quasi- ordered Domains.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Algorithmic Analysis of Programs with Well Quasi- ordered Domains

Reference 1

Resolution: verified exact; raw_fallback, observed 2026-08-15T20:27:49.995721Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a29f4891-86d4-48f0-a745-64acdd2ab5af · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-15T20:27:50.526106Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 47b852e5-5b39-4b36-81f1-bfa8a9163d7d · outbound

This paper cites Coverability in 1-V ASS with Disequality Tests.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Coverability in 1-V ASS with Disequality Tests

Reference 3

Resolution: verified exact; doi, observed 2026-08-15T20:27:49.758128Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7627b424-0d91-410c-baca-981a554e6f63 · outbound

This paper cites Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Reachability in Two-Dimensional Vector Addition Systems with States Is PSPACE-Complete

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.496089Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation e943de05-5365-42a8-abbe-7d1052312906 · outbound

This paper cites On the Space and Time Com- plexity of Functions Computable by Simple Programs.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter On the Space and Time Com- plexity of Functions Computable by Simple Programs

Reference 5

Resolution: verified exact; doi, observed 2026-08-15T20:27:49.732905Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 25149e0c-94fe-465a-8ba9-fb0cbeedabdb · outbound

This paper cites The complexity of short two-person games.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter The complexity of short two-person games

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.480747Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c974e0e2-a01f-4562-a37c-9dba483bab65 · outbound

This paper cites A Taxonomy of Problems with Fast Parallel Algorithms.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter A Taxonomy of Problems with Fast Parallel Algorithms

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.465174Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 407c3bed-f231-4802-bf81-861fb09ed050 · outbound

This paper cites New Lower Bounds for Reachability in Vector Addition Systems.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter New Lower Bounds for Reachability in Vector Addition Systems

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.449228Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 37c0e510-9ea2-4a76-85ca-a5c1317c5ac0 · outbound

This paper cites Lower Bounds for the Reachability Problem in Fixed Dimensional V ASSes.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Lower Bounds for the Reachability Problem in Fixed Dimensional V ASSes

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.433455Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f4d67838-eed8-4444-a154-0c8254ad4530 · outbound

This paper cites Reset Nets Between Decidability and Undecidability.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Reset Nets Between Decidability and Undecidability

Reference 11

Resolution: verified exact; doi, observed 2026-08-15T20:27:49.717098Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 6bb4db9e-28a9-43af-9d1e-2843549f70ce · outbound

This paper cites Carath ´eodory bounds for integer cones.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Carath ´eodory bounds for integer cones

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-15T20:27:49.471077Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 95facb9e-83e1-4a8d-ba08-69c1a368902e · outbound

This paper cites Reachability in Two- Clock Timed Automata Is PSPACE-Complete.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Reachability in Two- Clock Timed Automata Is PSPACE-Complete

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-15T20:27:49.475655Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5ff4a341-8c0a-40d0-bdfa-86b104d69437 · outbound

This paper cites Well-structured tran- sition systems everywhere!.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Well-structured tran- sition systems everywhere!

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.418041Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 2f687152-4a26-427b-ae12-ec5a9c7dd1cd · outbound

This paper cites Semigroups, Presburger formulas, and languages.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Semigroups, Presburger formulas, and languages

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.403063Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 7b90da6e-7d1f-409d-8a49-aa3b84c78c98 · outbound

This paper cites Integer Vector Addition Systems with States.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Integer Vector Addition Systems with States

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-15T20:27:49.488685Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1fc6600c-4b9d-46dc-82b8-16bf07e0ff2c · outbound

This paper cites Reachability in Succinct and Parametric One-Counter Automata.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Reachability in Succinct and Parametric One-Counter Automata

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.387833Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation e81a0a57-5a5a-4a5e-8281-38ceb0d1bcf9 · outbound

This paper cites On Effective Representations of Well Quasi- Orderings.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter On Effective Representations of Well Quasi- Orderings

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.372763Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 857876d6-6c80-4ded-a819-ecdd23ede8b5 · outbound

This paper cites The Reachability Problem for Petri Nets is Not Primitive Recursive.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter The Reachability Problem for Petri Nets is Not Primitive Recursive

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-15T20:27:49.509153Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bbc69b7e-5972-4cd4-9240-373c54841b73 · outbound

This paper cites Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Di- mension.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Reachability in Vector Addition Systems is Primitive-Recursive in Fixed Di- mension

Reference 20

Resolution: unresolved; no resolver link, observed 2026-08-15T20:27:49.513571Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3701399-726d-4887-9fa6-37b4745a9462 · outbound

This paper cites Computing Linear Arithmetic Representation of Reachability Relation of One-Counter Automata.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Computing Linear Arithmetic Representation of Reachability Relation of One-Counter Automata

Reference 21

Resolution: malformed identifier; no resolver link, observed 2026-08-15T20:27:49.517951Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation cc75a3d4-2e5a-498d-b3d6-e5553974dbfd · outbound

This paper cites The reachability problem is exponential- space hard.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter The reachability problem is exponential- space hard

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.357928Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 8b1d5cbf-4fcb-4ff6-9cf2-fef869f2c36e · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 23

Resolution: unresolved; raw_fallback, observed 2026-08-15T20:27:50.342947Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation d831a67e-6f0d-45d5-8147-ef0a169c6ddf · outbound

This paper cites The covering and boundedness problems for vector addition systems.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter The covering and boundedness problems for vector addition systems

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.328030Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation a2afe4d7-3cd5-4cfa-a196-20f60f485883 · outbound

This paper cites A multiparameter analysis of the boundedness problem for vector addition sys- tems.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter A multiparameter analysis of the boundedness problem for vector addition sys- tems

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.312765Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 6d11890b-07d1-4d57-8fc7-26c8a7d73ad2 · outbound

This paper cites Counting in Trees for Free.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Counting in Trees for Free

Reference 26

Resolution: malformed identifier; raw_fallback, observed 2026-08-15T20:27:50.297504Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation cdb1ad9e-9fdf-4d25-8525-0ba641572d57 · outbound

This paper cites V ollmer.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter V ollmer

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.282498Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 2666bb09-e4a5-4a53-afc8-e17f152ff43b · outbound

This paper cites A bound on solutions of linear integer equalities and inequalities.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter A bound on solutions of linear integer equalities and inequalities

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.267141Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 9f1238bd-d0bb-4848-8cbb-9cfb2b31d6d8 · outbound

This paper cites Example A.4.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Example A.4

Reference 32

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.250966Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f9a8dcfe-fafd-41e5-a8de-0fc989f15d4e · outbound

This paper cites • If n≤ 2m ε , then 2n + 1≤ 4m ε + 1≤ 5m ε and thus Dk,n(A,x )≥ 1 2n + 1≥ ε 5m = 1 5mD1(A).

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter • If n≤ 2m ε , then 2n + 1≤ 4m ε + 1≤ 5m ε and thus Dk,n(A,x )≥ 1 2n + 1≥ ε 5m = 1 5mD1(A)

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.235408Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 20447142-22c1-48e0-a868-6d4bc5e11839 · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 34

Resolution: unresolved; raw_fallback, observed 2026-08-15T20:27:50.220130Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 3c5a4c08-689f-4a00-ad8f-5613fd60e3a8 · outbound

This paper cites This means that there existsℓ≥ 1 such that for every δ≥ 1, there exists a t∈ Zp and an x∈ Z such that:.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter This means that there existsℓ≥ 1 such that for every δ≥ 1, there exists a t∈ Zp and an x∈ Z such that:

Reference 35

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.203985Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 2a325912-bf66-4433-b87b-c40b39e30cc3 · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 36

Resolution: parse uncertain; raw_fallback, observed 2026-08-15T20:27:50.188393Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 5bd40271-769a-46bb-b85b-1ce4a99e6525 · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 37

Resolution: parse uncertain; raw_fallback, observed 2026-08-15T20:27:50.172408Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 420391f9-5886-411d-91d7-2a7e296e75c8 · outbound

This paper cites Let δ = 1 2 2ℓ D(S)− 1.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Let δ = 1 2 2ℓ D(S)− 1

Reference 38

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.156956Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 56326494-4b18-4e0b-9237-b1cb6ee71b3d · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 39

Resolution: unresolved; raw_fallback, observed 2026-08-15T20:27:50.141259Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation f7d41684-2ff8-4ee2-bae2-0a3127ae885e · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 40

Resolution: unresolved; raw_fallback, observed 2026-08-15T20:27:50.125286Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 58ed9620-5a8f-4177-b7b2-ec57480d1fd9 · outbound

This paper cites Indeed, iff1 ∗ ⇐⇒f′ 1 andf2 ∗ ⇐⇒f′ 2, then (19) yields f1 +f2 ∗ ⇐⇒f′ 1 +f2 ∗ ⇐⇒f′ 1 +f′ 2 andf1f2 ∗ ⇐⇒f′ 1f2 ∗ ⇐⇒f′ 1f′ 2, since addition and multiplication are commutative.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Indeed, iff1 ∗ ⇐⇒f′ 1 andf2 ∗ ⇐⇒f′ 2, then (19) yields f1 +f2 ∗ ⇐⇒f′ 1 +f2 ∗ ⇐⇒f′ 1 +f′ 2 andf1f2 ∗ ⇐⇒f′ 1f2 ∗ ⇐⇒f′ 1f′ 2, since addition and multiplication are commutative

Reference 41

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.109176Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 28c3a551-daa2-4267-ac94-7489f56799c9 · outbound

This paper cites This follows by considering the possible values for n+: If n+ = n, then the expression is exactly D+(A).

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter This follows by considering the possible values for n+: If n+ = n, then the expression is exactly D+(A)

Reference 42

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.093135Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 3e9b1979-eb6f-410a-99e2-9216bc0b579a · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 43

Resolution: unresolved; raw_fallback, observed 2026-08-15T20:27:50.076419Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation b7da52e9-5e1e-4b44-861d-38f8816b949d · outbound

This paper cites We call such a pair ⟨t,x⟩ a hard pair for δ.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter We call such a pair ⟨t,x⟩ a hard pair for δ

Reference 44

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.060274Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation c4dfe303-8f1d-41b0-b134-e47c65584607 · outbound

This paper cites Then f +g = 0 , and thus f = 0 or g = 0.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Then f +g = 0 , and thus f = 0 or g = 0

Reference 45

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.044729Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation cd11248a-0719-4897-8f00-ed34ad9577ff · outbound

This paper cites Then f(i)≥ 0 or g(i)≥ 0, and thus Xi≤f orXi≤g.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Then f(i)≥ 0 or g(i)≥ 0, and thus Xi≤f orXi≤g

Reference 46

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.028782Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 75b152b1-3965-4467-88a9-72ab213d129d · outbound

This paper cites largest gap size.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter largest gap size

Reference 47

Resolution: verified fuzzy; raw_fallback, observed 2026-08-15T20:27:50.013047Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 981104f3-812d-4a5c-b0be-338cc260e2d9 · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 383

Resolution: unresolved; no resolver link, observed 2026-08-15T20:27:49.498962Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da3411e3-0e19-4049-b110-94d0e1f569a8 · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 1974

Resolution: parse uncertain; raw_fallback, observed 2026-08-15T20:27:50.511086Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.

Observation 1b53bcc0-085c-417d-9ff8-b49a3cbf3ba3 · outbound

This paper cites an unresolved cited work.

A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter Unresolved cited work

Reference 2015

Resolution: unresolved; no resolver link, observed 2026-08-15T20:27:49.433652Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation 152f792e-759a-4ec6-9198-aaa3022e5bd3 · inbound

On the complexity of computing Strahler numbers cites this paper.

On the complexity of computing Strahler numbers A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter

Reference 1990

Resolution: metadata mismatch; local_arxiv, observed 2026-08-03T15:09:20.594825Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.