On the public citation graph

On reversible automata

0 signed · 114 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-13345-3_30openalex-snapshot

Languages and inverse semigroups

inferredcites →https://doi.org/10.1007/978-3-663-09367-1openalex-snapshot

Transductions and Context-Free Languages

inferredcites →https://doi.org/10.1007/978-94-009-3839-7_3openalex-snapshot

Finite Semigroups Whose Idempotents Commute or Form a Subsemigroup

inferredcites →https://doi.org/10.1007/bf02572788openalex-snapshot

Sur mon article “une topologie du monoide libre”

inferredcites →https://doi.org/10.1007/bf02573280openalex-snapshot

On a conjecture of Rhodes

inferredcites →https://doi.org/10.1007/bf02574174openalex-snapshot

Une Topologie du Monoïde Libre

inferredcites →https://doi.org/10.1007/bfb0015770openalex-snapshot

Finite group topology and p-adic topology for free monoids

inferredcites →https://doi.org/10.1016/0020-0190(92)90198-5openalex-snapshot

Intersection and union of regular languages and state complexity

inferredcites →https://doi.org/10.1016/0021-8693(87)90048-2openalex-snapshot

Inverse semigroups and varieties of finite semigroups

inferredcites →https://doi.org/10.1016/0021-8693(91)90094-oopenalex-snapshot

Topologies for the free monoid

inferredcites →https://doi.org/10.1016/0022-4049(92)90148-9openalex-snapshot

New results on the conjecture of Rhodes and on the topological conjecture

inferredcites →https://doi.org/10.1016/0304-3975(84)90031-8openalex-snapshot

Biprefix codes, inverse semigroups and syntactic monoids of injective automata

inferredcites →https://doi.org/10.1016/s0019-9958(67)90481-0openalex-snapshot

The loop complexity of pure-group events

inferredcites →https://doi.org/10.1016/s0079-8169(08)x6055-6openalex-snapshot

Automata, Languages, and Machines

inferredcites →https://doi.org/10.1016/s0747-7171(08)80125-3openalex-snapshot

AUTOMATE, a computing package for automata and finite semigroups

inferredcites →https://doi.org/10.1017/s0004972700027805openalex-snapshot

A topological approach to a conjecture of Rhodes

inferredcites →https://doi.org/10.1017/s1446788700028998openalex-snapshot

Finite semigroups with commuting idempotents

inferredcites →https://doi.org/10.1112/blms/12.3.230bopenalex-snapshot

SEMIGROUPS AND COMBINATORIAL APPLICATIONS

inferredcites →https://doi.org/10.1112/blms/23.4.356openalex-snapshot

A Conjecture on the Hall Topology for the Free Group

inferredcites →https://doi.org/10.1112/blms/25.1.37openalex-snapshot

On The Profinite Topology on a Free Group

inferredcites →https://doi.org/10.1142/s0218196791000079openalex-snapshot

INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES

inferredcites →https://doi.org/10.1142/s0218196791000298openalex-snapshot

ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I

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

Inference of Reversible Languages

inferredcites →https://doi.org/10.2307/1969513openalex-snapshot

A Topology for Free Groups and Related Groups

inferredcites →https://doi.org/10.5860/choice.43-3144openalex-snapshot

Encyclopedia of mathematics

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11809678_11openalex-snapshot

Varieties Generated by Certain Models of Reversible Finite Automata

inferred← citeshttps://doi.org/10.1007/3-540-44693-1_8openalex-snapshot

Star-Free Open Languages and Aperiodic Loops

inferred← citeshttps://doi.org/10.1007/3-540-45089-0_7openalex-snapshot

Bideterministic Automata and Minimal Representations of Regular Languages

inferred← citeshttps://doi.org/10.1007/3-540-45465-9_16openalex-snapshot

On the Construction of Reversible Automata for Reversible Languages

inferred← citeshttps://doi.org/10.1007/3-540-45995-2_12openalex-snapshot

Star Height of Reversible Languages and Universal Automata

inferred← citeshttps://doi.org/10.1007/3-540-47849-3_21openalex-snapshot

Quantum Finite Multitape Automata

inferred← citeshttps://doi.org/10.1007/3-540-57785-8_175openalex-snapshot

Economy of description for single-valued transducers

inferred← citeshttps://doi.org/10.1007/978-1-4757-6048-4_44openalex-snapshot

Quantum Computers and Quantum Automata

inferred← citeshttps://doi.org/10.1007/978-1-4939-6883-1_456openalex-snapshot

Reversible Computing

inferred← citeshttps://doi.org/10.1007/978-3-030-47361-7openalex-snapshot

Reversible Computation: Extending Horizons of Computing

inferred← citeshttps://doi.org/10.1007/978-3-030-47361-7_1openalex-snapshot

Foundations of Reversible Computation

inferred← citeshttps://doi.org/10.1007/978-3-030-48516-0_5openalex-snapshot

An Approach to the Herzog-Schönheim Conjecture Using Automata

inferred← citeshttps://doi.org/10.1007/978-3-030-54997-8_28openalex-snapshot

Quotients and Atoms of Reversible Languages

inferred← citeshttps://doi.org/10.1007/978-3-030-71995-1_23openalex-snapshot

Nondeterministic Syntactic Complexity

inferred← citeshttps://doi.org/10.1007/978-3-030-77102-7_1openalex-snapshot

Transition Graphs of Reversible Reaction Systems

inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_29openalex-snapshot

Learning from Positive and Negative Examples: Dichotomies and Parameterized Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-031-07469-1_16openalex-snapshot

Energy Complexity of Regular Language Recognition

inferred← citeshttps://doi.org/10.1007/978-3-031-07469-1_17openalex-snapshot

Real-Time, Constant-Space, Constant-Randomness Verifiers

inferred← citeshttps://doi.org/10.1007/978-3-031-19685-0_12openalex-snapshot

Bideterministic Weighted Automata

inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_11openalex-snapshot

On Pumping Preserving Homomorphisms and the Complexity of the Pumping Problem (Extended Abstract)

inferred← citeshttps://doi.org/10.1007/978-3-032-02602-6_22openalex-snapshot

A Hierarchy of Reversible Finite Automata

inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_3openalex-snapshot

Seventy Years of Algebraic, Logical, and Topological Methods for Regular Languages

inferred← citeshttps://doi.org/10.1007/978-3-032-28404-4_6openalex-snapshot

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents

inferred← citeshttps://doi.org/10.1007/978-3-319-08494-7_4openalex-snapshot

Degrees of Reversibility for DFA and DPDA

inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_7openalex-snapshot

Aspects of Reversibility for Classical Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-18812-6_5openalex-snapshot

Real-Time Reversible One-Way Cellular Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-20860-2_4openalex-snapshot

Reversible Ordered Restarting Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-21500-6_22openalex-snapshot

Minimal Reversible Deterministic Finite Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-23111-2_8openalex-snapshot

Reversible Limited Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-40578-0_6openalex-snapshot

Boosting Reversible Pushdown Machines by Preprocessing

inferred← citeshttps://doi.org/10.1007/978-3-319-41114-9_13openalex-snapshot

Minimal and Reduced Reversible Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-58631-1_11openalex-snapshot

Fast One-Way Cellular Automata with Reversible Mealy Cells

inferred← citeshttps://doi.org/10.1007/978-3-319-59108-7_7openalex-snapshot

Template-Based Pattern Matching in Two-Dimensional Arrays

inferred← citeshttps://doi.org/10.1007/978-3-319-59936-6_3openalex-snapshot

Reversible Nondeterministic Finite Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-60134-2_13openalex-snapshot

Transducing Reversibly with Finite State Machines

inferred← citeshttps://doi.org/10.1007/978-3-319-60252-3_19openalex-snapshot

Concise Representations of Reversible Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-62809-7_28openalex-snapshot

Classifying Non-periodic Sequences by Permutation Transducers

inferred← citeshttps://doi.org/10.1007/978-3-319-73216-9_13openalex-snapshot

The Computing Power of Determinism and Reversibility in Chemical Reaction Automata

inferred← citeshttps://doi.org/10.1007/978-3-319-73216-9_19openalex-snapshot

Queue Automata: Foundations and Developments

inferred← citeshttps://doi.org/10.1007/978-3-319-98654-8_29openalex-snapshot

Reversible Pushdown Transducers

inferred← citeshttps://doi.org/10.1007/978-3-540-73208-2_38openalex-snapshot

On Transition Minimality of Bideterministic Automata

inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_33openalex-snapshot

Real-Time Reversible Iterative Arrays

inferred← citeshttps://doi.org/10.1007/978-3-642-13089-2_31openalex-snapshot

Reversible Pushdown Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_456-3openalex-snapshot

Reversible Computing

inferred← citeshttps://doi.org/10.1007/978-3-642-36315-3_2openalex-snapshot

One-Way Reversible Multi-head Finite Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-38986-3_14openalex-snapshot

Time-Symmetric Machines

inferred← citeshttps://doi.org/10.1007/978-3-662-48057-1_3openalex-snapshot

Reversible and Irreversible Computations of Deterministic Finite-State Devices

inferred← citeshttps://doi.org/10.1007/978-981-97-2614-1_13openalex-snapshot

Parallel Communicating One-Way Reversible Finite Automata System

inferred← citeshttps://doi.org/10.1007/s00236-016-0267-0openalex-snapshot

Reversible Watson–Crick automata

inferred← citeshttps://doi.org/10.1007/s00236-020-00388-1openalex-snapshot

An instruction set for reversible Turing machines

inferred← citeshttps://doi.org/10.1007/s00236-020-00389-0openalex-snapshot

Reversibility for stateless ordered RRWW-automata

inferred← citeshttps://doi.org/10.1007/s00236-025-00519-6openalex-snapshot

Sweeping permutation automata

inferred← citeshttps://doi.org/10.1016/j.ejc.2023.103812openalex-snapshot

Unambiguously coded shifts

inferred← citeshttps://doi.org/10.1016/j.ic.2008.03.015openalex-snapshot

Fast reversible language recognition using cellular automata

inferred← citeshttps://doi.org/10.1016/j.ic.2014.10.003openalex-snapshot

One-way reversible and quantum finite automata with advice

inferred← citeshttps://doi.org/10.1016/j.ic.2021.104813openalex-snapshot

Reversible pushdown transducers

inferred← citeshttps://doi.org/10.1016/j.ipl.2007.12.004openalex-snapshot

On the efficient construction of quasi-reversible automata for reversible languages

inferred← citeshttps://doi.org/10.1016/j.jcss.2011.12.004openalex-snapshot

Reversible pushdown automata

inferred← citeshttps://doi.org/10.1016/j.jpaa.2015.12.007openalex-snapshot

Stone duality, topological algebra, and recognition

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.010openalex-snapshot

Bideterministic automata and minimal representations of regular languages

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.01.029openalex-snapshot

Identification of biRFSA languages

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.032openalex-snapshot

Learning in varieties of the form V*LI from positive data

inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.026openalex-snapshot

Automata theory based on quantum logic: Reversibilities and pushdown automata

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.07.009openalex-snapshot

On locally reversible languages

inferred← citeshttps://doi.org/10.1016/j.tcs.2009.10.017openalex-snapshot

Real-time reversible iterative arrays

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.11.021openalex-snapshot

On the size of inverse semigroups given by generators

inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.006openalex-snapshot

One-way reversible multi-head finite automata

inferred← citeshttps://doi.org/10.1016/j.tcs.2019.06.021openalex-snapshot

Transducing reversibly with finite state machines

inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00083-xopenalex-snapshot

On viewing block codes as finite automata

inferred← citeshttps://doi.org/10.1051/ita:2008022openalex-snapshot

Minimal NFA and biRFSA Languages

inferred← citeshttps://doi.org/10.1063/1.3637490openalex-snapshot

Information symmetries in irreversible processes

inferred← citeshttps://doi.org/10.1080/00927872.2021.1924766openalex-snapshot

Herzog–Schönheim conjecture, vanishing sums of roots of Unity and convex polygons

inferred← citeshttps://doi.org/10.1109/sfcs.1998.743469openalex-snapshot

1-way quantum finite automata: strengths, weaknesses and generalizations

inferred← citeshttps://doi.org/10.1109/tit.2025.3544970openalex-snapshot

Bounding the Graph Capacity With Quantum Mechanics and Finite Automata

inferred← citeshttps://doi.org/10.1142/s0129054119400331openalex-snapshot

Concise Representations of Reversible Automata

inferred← citeshttps://doi.org/10.1142/s0129054122410040openalex-snapshot

Descriptive Complexity of Reversible Languages Having Finitely Many Reduced Automata

inferred← citeshttps://doi.org/10.1142/s0129054122410052openalex-snapshot

Weakly and Strongly Irreversible Regular Languages

inferred← citeshttps://doi.org/10.1142/s0129054125410084openalex-snapshot

The Pumping Lemma for Regular Languages is Hard

inferred← citeshttps://doi.org/10.1142/s0218196719500425openalex-snapshot

The Herzog–Schönheim conjecture for finitely generated groups

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

Model-Checking Linear-Time Properties of Quantum Systems

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

Stackless Processing of Streamed Trees

inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cccopenalex-snapshot

Nondeterministic Syntactic Complexity

inferred← citeshttps://doi.org/10.3233/fi-2017-1575openalex-snapshot

Reversible Limited Automata

inferred← citeshttps://doi.org/10.4204/eptcs.252.13openalex-snapshot

Reversible Languages Having Finitely Many Reduced Automata

inferred← citeshttps://doi.org/10.4204/eptcs.252.15openalex-snapshot

Weakly and Strongly Irreversible Regular Languages

inferred← citeshttps://doi.org/10.4204/eptcs.388.11openalex-snapshot

Sweeping Permutation Automata

inferred← citeshttps://doi.org/10.4204/eptcs.422.7openalex-snapshot

On some Classes of Reversible 2-head Automata

inferred← citeshttps://doi.org/10.4230/lipics.stacs.2009.1856openalex-snapshot

Profinite Methods in Automata Theory

inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/9905026openalex-snapshot

Quantum finite multitape 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.