On the public citation graph

Path Systems: Constructions, Solutions and Applications

https://doi.org/10.1137/0209029

0 signed · 18 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-08353-7_172openalex-snapshot

Time and tape bounded auxiliary pushdown automata

inferredcites →https://doi.org/10.1016/s0019-9958(78)90289-9openalex-snapshot

Visits, crosses, and reversals for nondeterministic off-line machines

inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot

Relationships between nondeterministic and deterministic tape complexities

inferredcites →https://doi.org/10.1016/s0022-0000(71)80029-6openalex-snapshot

Characterizations of some tape and time complexity classes of turing machines in terms of multihead and auxiliary stack automata

inferredcites →https://doi.org/10.1080/00207167708803124openalex-snapshot

Recursive turing machines †

inferredcites →https://doi.org/10.1145/321623.321625openalex-snapshot

Characterizations of Pushdown Machines in Terms of Time-Bounded Computers

inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot

Formal Languages and their Relation to Automata

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/scj.4690160203openalex-snapshot

Relationships between time‐leaf‐and‐space bounded ATMS and reversal‐and‐space bounded NTMs

inferred← citeshttps://doi.org/10.1007/3-540-13345-3_22openalex-snapshot

Space and time efficient simulations and characterizations of some restricted classes of PDAS

inferred← citeshttps://doi.org/10.1007/978-3-642-82456-2_24openalex-snapshot

The Complexity of Two-Way Pushdown Automata and Recursive Programs

inferred← citeshttps://doi.org/10.1007/bf01786980openalex-snapshot

(Semi)alternating stack automata

inferred← citeshttps://doi.org/10.1007/bf02090763openalex-snapshot

The complexity of ranking simple languages

inferred← citeshttps://doi.org/10.1007/bfb0028793openalex-snapshot

Algorithms solving path systems

inferred← citeshttps://doi.org/10.1016/0020-0190(82)90039-4openalex-snapshot

Time complexity of unambiguous path systems

inferred← citeshttps://doi.org/10.1016/0022-0000(80)90036-7openalex-snapshot

Tree-size bounded alternation

inferred← citeshttps://doi.org/10.1016/s0019-9958(85)80029-2openalex-snapshot

Some characterizations of multihead finite automata

inferred← citeshttps://doi.org/10.1137/0213010openalex-snapshot

Alternating Pushdown and Stack Automata

inferred← citeshttps://doi.org/10.1145/800076.802472openalex-snapshot

Measures of parallelism in alternating computation trees (Extended Abstract)

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.