On the public citation graph

Two-way automata with multiplicity

https://doi.org/10.1007/bfb0032024
0 signed · 27 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-53414-8_33openalex-snapshot
Two-way reading on words
inferredcites →https://doi.org/10.1016/0020-0190(89)90205-6openalex-snapshot
A note on the reduction of two-way automata to one-way automata
inferredcites →https://doi.org/10.1016/0304-3975(91)90143-popenalex-snapshot
The zig-zag power series: a two-way version of the ∗ operator
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/s0019-9958(61)80020-xopenalex-snapshot
On the definition of a family of automata
inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot
Automata, Languages, and Machines
inferredcites →https://doi.org/10.1051/ita/1985190100711openalex-snapshot
Automates boustrophedon, semi-groupe de Birget et monoïde inversif libre
inferredcites →https://doi.org/10.1051/ita/1990240100471openalex-snapshot
Two-way automaton computations
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.1147/rd.32.0198openalex-snapshot
The Reduction of Two-Way Automata to One-Way Automata
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.2307/2004143openalex-snapshot
Sequential Machines: Selected Papers
inferredcites →https://doi.org/10.2307/2034080openalex-snapshot
On a Theorem of R. Jungen
inferredcites →https://doi.org/10.4153/cjm-1986-025-6openalex-snapshot
Ensembles Reconnaissables de Mots Biinfinis

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-45007-6_9openalex-snapshot
Covering Problems from a Formal Language Point of View
inferred← citeshttps://doi.org/10.1007/3-540-53414-8_33openalex-snapshot
Two-way reading on words
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90302-aopenalex-snapshot
The operation ↑ on formal power series
inferred← citeshttps://doi.org/10.1051/ita/2016026openalex-snapshot
Two-way representations and weighted automata
inferred← citeshttps://doi.org/10.1051/ita/2016028openalex-snapshot
Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
inferred← citeshttps://doi.org/10.1109/lics.2013.53openalex-snapshot
From Two-Way to One-Way Finite State Transducers
inferred← citeshttps://doi.org/10.13130/guillon-bruno_phd2016-05-30openalex-snapshot
Two-wayness: Automata and Transducers
inferred← citeshttps://doi.org/10.25596/jalc-2005-003openalex-snapshot
A Language-Theoretic Approach to Covering Problems
inferred← citeshttps://doi.org/10.4204/eptcs.151.13openalex-snapshot
On Determinism and Unambiguity of Weighted Two-way Automata
inferred← citeshttps://doi.org/10.5555/2591370.2591389openalex-snapshot
From Two-Way to One-Way Finite State Transducers
inferred← citeshttps://doi.org/10.70675/43f2ee1dz6e07z45d7z9943z4266a09be8b1openalex-snapshot
Autour des automates : génération aléatoire et contribution à quelques extensions
inferred← citeshttps://doi.org/10.70675/7cc7ddf3z2277z4beazbdc0z397768f2b7ebopenalex-snapshot
Expressivité des automates pondérés circulaires et boustrophédons
inferred← citeshttps://doi.org/10.70675/9ec2dc59zadb1z414fz949fz0fd1afaab001openalex-snapshot
Specification and verification of quantitative properties : expressions, logics, and automata
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.