On the public citation graph

A note on multihead automata and context-sensitive languages

https://doi.org/10.1007/bf00289080
0 signed · 26 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/bf00289513openalex-snapshot
On non-determinancy in simple computing devices
inferredcites →https://doi.org/10.1016/s0022-0000(70)80006-xopenalex-snapshot
Relationships between nondeterministic and deterministic tape complexities
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.1007/11527800_18openalex-snapshot
P Systems: Some Recent Results and Research Problems
inferred← citeshttps://doi.org/10.1007/11549345_4openalex-snapshot
Some Computational Issues in Membrane Computing
inferred← citeshttps://doi.org/10.1007/11753681_10openalex-snapshot
On Bounded Symport/Antiport P Systems
inferred← citeshttps://doi.org/10.1007/3-540-06841-4_80openalex-snapshot
On The Structure of Complexity Classes
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_29openalex-snapshot
The LBA-problem and the transformability of the class ɛ2
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_30openalex-snapshot
On the LBA problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73554-0_21openalex-snapshot
Bond Computing Systems: A Biologically Inspired and High-Level Dynamics Model for Pervasive Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-88869-7_14openalex-snapshot
On Nonuniversal Symport/Antiport P Systems
inferred← citeshttps://doi.org/10.1007/bf00263746openalex-snapshot
Transformational methods and their application to complexity problems
inferred← citeshttps://doi.org/10.1007/bf00271345openalex-snapshot
The LBA-problem and the deterministic tape complexity of two-way one-counter languages over a one-letter alphabet
inferred← citeshttps://doi.org/10.1007/bf01768464openalex-snapshot
Inclusion complete tally languages and the Hartmanis-Berman conjecture
inferred← citeshttps://doi.org/10.1007/bf02088003openalex-snapshot
Sublogarithmic-space turing machines, nonuniform space complexity, and closure properties
inferred← citeshttps://doi.org/10.1007/bf02679465openalex-snapshot
Expressing Uniformity via Oracles
inferred← citeshttps://doi.org/10.1007/s11047-009-9134-zopenalex-snapshot
Bond computing systems: a biologically inspired and high-level dynamics model for pervasive computing
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.045openalex-snapshot
On the computational complexity of membrane systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.013openalex-snapshot
On the descriptional power of heads, counters, and pebbles
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.03.052openalex-snapshot
On determinism versus nondeterminism in P systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.003openalex-snapshot
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport P systems
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)90473-2openalex-snapshot
Tally languages and complexity classes
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80043-6openalex-snapshot
Complexity of the first-order theory of almost all finite structures
inferred← citeshttps://doi.org/10.1016/s0022-0000(75)80014-6openalex-snapshot
On tape-bounded complexity classes and multihead finite automata
inferred← citeshttps://doi.org/10.1080/17445760701640266openalex-snapshot
Computing with cells: membrane systems – some complexity issues
inferred← citeshttps://doi.org/10.1109/bicta.2010.5645200openalex-snapshot
Symport/antiport P systems with look-ahead mode
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.