On the public citation graph

Multihead two-way probabilistic finite automata

https://doi.org/10.1007/bf02679455
0 signed · 58 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-08342-1_37openalex-snapshot
On the difference between one and many
inferredcites →https://doi.org/10.1007/3-540-10856-4_101openalex-snapshot
Relationships between probabilistic and deterministic tape complexity
inferredcites →https://doi.org/10.1007/3-540-10856-4_72openalex-snapshot
Probabilistic two-way machines
inferredcites →https://doi.org/10.1007/3-540-13345-3_25openalex-snapshot
On probabilistic tape complexity and fast circuits for matrix inversion problems
inferredcites →https://doi.org/10.1007/3-540-54458-5_73openalex-snapshot
Regularity of one-letter languages acceptable by 2-way finite probabilistic automata
inferredcites →https://doi.org/10.1007/3-540-56287-7_121openalex-snapshot
Some observations on 2-way probabilistic finite automata
inferredcites →https://doi.org/10.1007/3-540-57785-8_135openalex-snapshot
Space-efficient deterministic simulation of probabilistic automata
inferredcites →https://doi.org/10.1007/3-540-58201-0_100openalex-snapshot
Lower space bounds for randomized computation
inferredcites →https://doi.org/10.1007/bf00263746openalex-snapshot
Transformational methods and their application to complexity problems
inferredcites →https://doi.org/10.1007/bf00289513openalex-snapshot
On non-determinancy in simple computing devices
inferredcites →https://doi.org/10.1007/bf00299636openalex-snapshot
The method of forced enumeration for nondeterministic automata
inferredcites →https://doi.org/10.1007/bf01683259openalex-snapshot
New problems complete for nondeterministic log space
inferredcites →https://doi.org/10.1007/bfb0015756openalex-snapshot
On probabilistic time and space
inferredcites →https://doi.org/10.1007/bfb0019368openalex-snapshot
Complexity of probabilistic versus deterministic automata
inferredcites →https://doi.org/10.1016/0012-365x(72)90124-0openalex-snapshot
Introduction to probabilistic automata
inferredcites →https://doi.org/10.1016/0020-0190(90)90072-6openalex-snapshot
Making a fair roulette from a possibly biased coin
inferredcites →https://doi.org/10.1016/0020-0190(94)00218-nopenalex-snapshot
Decreasing the bandwidth of a transition matrix
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(88)90122-3openalex-snapshot
Alternating multihead finite automata
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/c2013-0-11297-4openalex-snapshot
Introduction to Probabilistic Automata
inferredcites →https://doi.org/10.1016/s0019-9958(83)80060-6openalex-snapshot
Parallel computation for well-endowed rings and space-bounded probabilistic 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(73)80048-0openalex-snapshot
On two-way multihead automata
inferredcites →https://doi.org/10.1016/s0022-0000(75)80014-6openalex-snapshot
On tape-bounded complexity classes and multihead finite automata
inferredcites →https://doi.org/10.1016/s0022-0000(75)80050-xopenalex-snapshot
Space-bounded reducibility among combinatorial problems
inferredcites →https://doi.org/10.1016/s0022-0000(77)80041-xopenalex-snapshot
Techniques for separating space complexity classes
inferredcites →https://doi.org/10.1016/s0022-0000(77)80042-1openalex-snapshot
Relating refined space complexity classes
inferredcites →https://doi.org/10.1051/ita/1980140100671openalex-snapshot
Two-way multihead automata over a one-letter alphabet
inferredcites →https://doi.org/10.1090/s0002-9939-1969-0249221-4openalex-snapshot
Probabilistic Turing Machines and Computability
inferredcites →https://doi.org/10.1090/s0002-9947-1965-0170805-7openalex-snapshot
On the Computational Complexity of Algorithms
inferredcites →https://doi.org/10.1090/s0002-9947-1971-0281555-3openalex-snapshot
Computability by Probabilistic Turing Machines
inferredcites →https://doi.org/10.1109/focs.1965.14openalex-snapshot
Memory bounds for recognition of context-free and context-sensitive languages
inferredcites →https://doi.org/10.1109/focs.1965.33openalex-snapshot
Translational methods and computational complexity
inferredcites →https://doi.org/10.1109/swat.1974.29openalex-snapshot
Two way deterministic pushdown automaton languages and some open problems in the theory of computation
inferredcites →https://doi.org/10.1137/0206049openalex-snapshot
Computational Complexity of Probabilistic Turing Machines
inferredcites →https://doi.org/10.1137/0217058openalex-snapshot
Nondeterministic Space is Closed under Complementation
inferredcites →https://doi.org/10.1137/s0097539793253851openalex-snapshot
Space-Efficient Deterministic Simulation of Probabilistic Automata
inferredcites →https://doi.org/10.1145/146585.146599openalex-snapshot
Finite state verifiers I
inferredcites →https://doi.org/10.1145/322063.322076openalex-snapshot
k + 1 Heads Are Better than k
inferredcites →https://doi.org/10.1145/322077.322083openalex-snapshot
On the Tape Complexity of Deterministic Context-Free Languages
inferredcites →https://doi.org/10.1145/800070.802194openalex-snapshot
Space-bounded hierarchies and probabilistic computations
inferredcites →https://doi.org/10.1145/800076.802469openalex-snapshot
Space-bounded probabilistic turing machine complexity classes are closed under complement (Preliminary Version)
inferredcites →https://doi.org/10.2307/2283131openalex-snapshot
John von Neumann Collected Works:
inferredcites →https://doi.org/10.5186/aasfm.1969.439openalex-snapshot
On languages representable in rational probabilistic 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/3-540-59175-3openalex-snapshot
LATIN '95: Theoretical Informatics
inferred← citeshttps://doi.org/10.1007/978-3-319-08846-4_11openalex-snapshot
Unary Languages Recognized by Two-Way One-Counter Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-21500-6_34openalex-snapshot
Complexity Bounds of Constant-Space Quantum Computation
inferred← citeshttps://doi.org/10.1007/978-3-642-30870-3_65openalex-snapshot
Finite State Verifiers with Constant Randomness
inferred← citeshttps://doi.org/10.1007/s00224-014-9547-7openalex-snapshot
The Complexity of Debate Checking
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00129-5openalex-snapshot
Amplification of slight probabilistic advantage at absolutely no cost in space
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10049-xopenalex-snapshot
A note on two-dimensional probabilistic Turing machines
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10084-1openalex-snapshot
Closure properties of the classes of sets recognized by space-bounded two-dimensional probabilistic turing machines
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00059-0openalex-snapshot
Properties of probabilistic pushdown automata
inferred← citeshttps://doi.org/10.1109/sip.2014.9openalex-snapshot
Remarks on Four-Dimensional Probabilistic Finite Automata
inferred← citeshttps://doi.org/10.1137/s0097539796298339openalex-snapshot
On the Structure of Logspace Probabilistic Complexity Classes
inferred← citeshttps://doi.org/10.48550/arxiv.1211.7346openalex-snapshot
Checking generalized debates with small space and randomness
inferred← citeshttps://doi.org/10.48550/arxiv.2002.00009openalex-snapshot
Probabilistic Complexity Classes through Semantics
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.