On the public citation graph

Permutation automata

https://doi.org/10.1007/bf01691347
0 signed · 34 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.1016/0016-0032(63)90871-8openalex-snapshot
An introduction to mathematical machine theory
inferredcites →https://doi.org/10.1016/0016-0032(67)90243-8openalex-snapshot
Algebraic structure theory of sequential machines
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems

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-45655-4_61openalex-snapshot
Probabilistic Reversible Automata and Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-48516-0_10openalex-snapshot
Operations on Permutation Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_16openalex-snapshot
State Complexity of Projection on Languages Recognized by Permutation Automata and Commuting Letters
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-13502-6_9openalex-snapshot
Closure Properties of Subregular Languages Under Operations
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_13openalex-snapshot
Decision Problems for Subregular Classes
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_22openalex-snapshot
Decision Problems for Reversible and Permutation Automata
inferred← citeshttps://doi.org/10.1007/978-3-031-71112-1_25openalex-snapshot
Measuring Power of Commutative Group Languages
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_1openalex-snapshot
On Some Decision Problems on Quantum Automata
inferred← citeshttps://doi.org/10.1007/978-3-032-32016-2_6openalex-snapshot
Exact Accepting-State Spectrum for Reversal of Permutation Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-24486-0_8openalex-snapshot
Learning a Random DFA from Uniform Strings and State Information
inferred← citeshttps://doi.org/10.1007/978-3-642-22993-0_33openalex-snapshot
Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
inferred← citeshttps://doi.org/10.1007/bf02574174openalex-snapshot
Une Topologie du Monoïde Libre
inferred← citeshttps://doi.org/10.1007/s00236-023-00439-3openalex-snapshot
On the undecidability and descriptional complexity of synchronized regular expressions
inferred← citeshttps://doi.org/10.1007/s00236-025-00519-6openalex-snapshot
Sweeping permutation automata
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105204openalex-snapshot
State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
inferred← citeshttps://doi.org/10.1016/j.indag.2016.11.004openalex-snapshot
Ordering sequences by permutation transducers
inferred← citeshttps://doi.org/10.1016/j.tcs.2009.01.042openalex-snapshot
On a class of languages recognizable by probabilistic reversible decide-and-halt automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114489openalex-snapshot
GF(2)-operations on basic families of formal languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.116049openalex-snapshot
Language membership problems for subregular classes
inferred← citeshttps://doi.org/10.1016/s0022-0000(73)80011-xopenalex-snapshot
A structure theory of automata characterized by groups
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175683openalex-snapshot
Group Separation Strikes Back
inferred← citeshttps://doi.org/10.1109/lics65433.2025.00031openalex-snapshot
Navigational hierarchies of regular languages
inferred← citeshttps://doi.org/10.1137/0207007openalex-snapshot
Computational Parallels between the Regular and Context-Free Languages
inferred← citeshttps://doi.org/10.1142/s0129054123430037openalex-snapshot
Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
inferred← citeshttps://doi.org/10.1142/s0129054123450016openalex-snapshot
Closure Properties of Subregular Languages Under Operations
inferred← citeshttps://doi.org/10.1145/3661814.3662082openalex-snapshot
Dot-depth three, return of the J-class
inferred← citeshttps://doi.org/10.3390/math13081265openalex-snapshot
Parallel Communicating Finite Automata: Productiveness and Succinctness
inferred← citeshttps://doi.org/10.4204/eptcs.151.19openalex-snapshot
More Structural Characterizations of Some Subregular Language Families by Biautomata
inferred← citeshttps://doi.org/10.4204/eptcs.388.11openalex-snapshot
Sweeping Permutation 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.