On the public citation graph
Синхронизация конечных автоматов
0 signed · 175 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11821069_68openalex-snapshot
An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
inferredcites →https://doi.org/10.1007/3-540-08860-1_25openalex-snapshot
Sur un cas particulier de la conjecture de Cerny
inferredcites →https://doi.org/10.1007/3-540-36377-7_3openalex-snapshot
Synchronization of Finite Automata: Contributions to an Old Problem
inferredcites →https://doi.org/10.1007/3-540-48683-6_36openalex-snapshot
Model Checking Based on Sequential ATPG
inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/978-3-030-28796-2_16openalex-snapshot
On Codeword Lengths Guaranteeing Synchronization
inferredcites →https://doi.org/10.1007/978-3-030-68195-1_24openalex-snapshot
Completely Reachable Automata, Primitive Groups and the State Complexity of the Set of Synchronizing Words
inferredcites →https://doi.org/10.1007/978-3-030-68195-1_25openalex-snapshot
State Complexity of the Set of Synchronizing Words for Circular Automata and Automata over Binary Alphabets
inferredcites →https://doi.org/10.1007/978-3-030-81508-0_17openalex-snapshot
Constrained Synchronization and Subset Synchronization Problems for Weakly Acyclic Automata
inferredcites →https://doi.org/10.1007/978-3-030-86593-1_19openalex-snapshot
Computational Complexity of Synchronization Under Sparse Regular Constraints
inferredcites →https://doi.org/10.1007/978-3-030-89543-3_15openalex-snapshot
Ideal Separation and General Theorems for Constrained Synchronization and Their Application to Small Constraint Automata
inferredcites →https://doi.org/10.1007/978-3-319-09698-8_6openalex-snapshot
On Two Algorithmic Problems about Synchronizing Automata
inferredcites →https://doi.org/10.1007/978-3-319-20297-6_21openalex-snapshot
Representation of (Left) Ideal Regular Languages by Synchronizing Automata
inferredcites →https://doi.org/10.1007/978-3-319-29221-2_7openalex-snapshot
On the Probability of Being Synchronizable
inferredcites →https://doi.org/10.1007/978-3-319-40946-7_15openalex-snapshot
Experiments with Synchronizing Automata
inferredcites →https://doi.org/10.1007/978-3-319-53733-7_18openalex-snapshot
Finding DFAs with Maximal Shortest Synchronizing Word Length
inferredcites →https://doi.org/10.1007/978-3-319-62809-7_8openalex-snapshot
DFAs and PFAs with Long Shortest Synchronizing Word Length
inferredcites →https://doi.org/10.1007/978-3-319-98654-8_31openalex-snapshot
Dynamics of the Independence Number and Automata Synchronization
inferredcites →https://doi.org/10.1007/978-3-540-88282-4_4openalex-snapshot
Synchronizing Automata and the Černý Conjecture
inferredcites →https://doi.org/10.1007/978-3-642-02737-6_5openalex-snapshot
Matrix Mortality and the Černý-Pin Conjecture
inferredcites →https://doi.org/10.1007/978-3-642-02737-6_6openalex-snapshot
A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata
inferredcites →https://doi.org/10.1007/978-3-642-03816-7_19openalex-snapshot
The Synchronization Problem for Locally Strongly Transitive Automata
inferredcites →https://doi.org/10.1007/978-3-642-15155-2_50openalex-snapshot
The Complexity of Finding Reset Words in Finite Automata
inferredcites →https://doi.org/10.1007/978-3-642-18098-9_17openalex-snapshot
Approximating Minimum Reset Sequences
inferredcites →https://doi.org/10.1007/978-3-642-18098-9_9openalex-snapshot
COMPAS - A Computing Package for Synchronization
inferredcites →https://doi.org/10.1007/978-3-642-22256-6_27openalex-snapshot
Experimental Study of the Shortest Reset Word of Random Automata
inferredcites →https://doi.org/10.1007/978-3-642-22953-4_15openalex-snapshot
Modifying the Upper Bound on the Length of Minimal Synchronizing Word
inferredcites →https://doi.org/10.1007/978-3-642-24288-5_16openalex-snapshot
Lower Bounds for the Length of Reset Words in Eulerian Automata
inferredcites →https://doi.org/10.1007/978-3-642-39274-0_30openalex-snapshot
Generating Small Automata and the Černý Conjecture
inferredcites →https://doi.org/10.1007/978-3-662-48057-1_19openalex-snapshot
Strong Inapproximability of the Shortest Reset Word
inferredcites →https://doi.org/10.1007/978-3-662-48057-1_26openalex-snapshot
Synchronizing Automata with Extremal Properties
inferredcites →https://doi.org/10.1007/978-3-662-53132-7_31openalex-snapshot
An Extremal Series of Eulerian Synchronizing Automata
inferredcites →https://doi.org/10.1007/b137241openalex-snapshot
Model-Based Testing of Reactive Systems
inferredcites →https://doi.org/10.1007/b13861openalex-snapshot
Substitutions in Dynamics, Arithmetics and Combinatorics
inferredcites →https://doi.org/10.1007/bf00534241openalex-snapshot
The spectrum of dynamical systems arising from substitutions of constant length
inferredcites →https://doi.org/10.1007/bf00971937openalex-snapshot
Synchronizing sequences and symbolic traversal techniques in test generation
inferredcites →https://doi.org/10.1007/bf01071771openalex-snapshot
In extremal combinatorial problem associated with the bound on the length of a synchronizing word in an automaton
inferredcites →https://doi.org/10.1007/bf01192046openalex-snapshot
The complexity of oblivious plans for orienting and distinguishing polygonal parts
inferredcites →https://doi.org/10.1007/bf01236507openalex-snapshot
Identities in full transformation semigroups
inferredcites →https://doi.org/10.1007/bf01891840openalex-snapshot
Orienting polygonal parts without sensors
inferredcites →https://doi.org/10.1007/bf02230720openalex-snapshot
Unzerlegbare, nicht negative Matrizen
inferredcites →https://doi.org/10.1007/bf02366314openalex-snapshot
Almost optimal bound of recurrent word length for regular automata
inferredcites →https://doi.org/10.1007/bf02366438openalex-snapshot
Resetting words for decidable automata
inferredcites →https://doi.org/10.1007/bf02392825openalex-snapshot
Clique is hard to approximate within n1−ε
inferredcites →https://doi.org/10.1007/bf02732984openalex-snapshot
Estimation of the length of reset words for automata with simple idempotents
inferredcites →https://doi.org/10.1007/bf02761605openalex-snapshot
Equivalence of topological Markov shifts
inferredcites →https://doi.org/10.1007/s00032-007-0070-zopenalex-snapshot
Synchronizing and Collapsing Words
inferredcites →https://doi.org/10.1007/s00224-013-9511-yopenalex-snapshot
Approximating the Minimum Length of Synchronizing Words Is Hard
inferredcites →https://doi.org/10.1007/s00236-009-0106-7openalex-snapshot
Strongly transitive automata and the Černý conjecture
inferredcites →https://doi.org/10.1007/s00454-006-1280-9openalex-snapshot
Computing Modular Coincidences for Substitution Tilings and Point Sets
inferredcites →https://doi.org/10.1007/s10559-022-00428-3openalex-snapshot
Cerny’s Conjecture for Automata with Simple Idempotents
inferredcites →https://doi.org/10.1007/s10801-009-0185-0openalex-snapshot
Černý’s conjecture and group representation theory
inferredcites →https://doi.org/10.1007/s10801-018-0851-1openalex-snapshot
A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
inferredcites →https://doi.org/10.1007/s10878-013-9682-0openalex-snapshot
Computing the shortest reset words of synchronizing automata
inferredcites →https://doi.org/10.1007/s10958-013-1392-8openalex-snapshot
Primitive digraphs with large exponents and slowly synchronizing automata
inferredcites →https://doi.org/10.1007/s11390-008-9165-4openalex-snapshot
Some Aspects of Synchronization of DFA
inferredcites →https://doi.org/10.1016/0016-0032(63)90871-8openalex-snapshot
An introduction to mathematical machine theory
inferredcites →https://doi.org/10.1016/0020-0190(83)90067-4openalex-snapshot
Polynomial complete problems in automata theory
inferredcites →https://doi.org/10.1016/0022-0000(84)90068-0openalex-snapshot
The complexity of facets (and some facets of complexity)
inferredcites →https://doi.org/10.1016/0022-0000(88)90039-6openalex-snapshot
The complexity of optimization problems
inferredcites →https://doi.org/10.1016/b978-0-12-417750-5.50023-3openalex-snapshot
BOUNDS ON THE LENGTH OF SYNCHRONIZING SEQUENCES AND THE ORDER OF INFORMATION LOSSLESSNESS
inferredcites →https://doi.org/10.1016/b978-044488002-4/50031-2openalex-snapshot
10.1016/b978-044488002-4/50031-2
inferredcites →https://doi.org/10.1016/j.aam.2012.07.003openalex-snapshot
Independent sets of words and the synchronization problem
inferredcites →https://doi.org/10.1016/j.aam.2018.04.006openalex-snapshot
Strongly connected synchronizing automata and the language of minimal reset words
inferredcites →https://doi.org/10.1016/j.dam.2020.04.029openalex-snapshot
Synchronizing sequences for road colored digraphs
inferredcites →https://doi.org/10.1016/j.disc.2012.06.002openalex-snapshot
Dixon’s theorem and random synchronization
inferredcites →https://doi.org/10.1016/j.eswa.2015.07.071openalex-snapshot
Forward and backward synchronizing algorithms
inferredcites →https://doi.org/10.1016/j.ic.2008.03.020openalex-snapshot
A series of slowly synchronizing automata with a zero state over a small alphabet
inferredcites →https://doi.org/10.1016/j.ic.2010.11.020openalex-snapshot
Synchronizing automata with finitely many minimal synchronizing words
inferredcites →https://doi.org/10.1016/j.ic.2015.04.001openalex-snapshot
Existence of constants in regular splicing languages
inferredcites →https://doi.org/10.1016/j.ins.2016.07.049openalex-snapshot
Algebraic synchronization criterion and computing reset words
inferredcites →https://doi.org/10.1016/j.jcss.2014.12.027openalex-snapshot
A multi-parameter analysis of hard problems on deterministic finite automata
inferredcites →https://doi.org/10.1016/j.jcss.2020.08.002openalex-snapshot
Preimage problems for deterministic finite automata
inferredcites →https://doi.org/10.1016/j.tcs.2004.03.068openalex-snapshot
Synchronizing monotonic automata
inferredcites →https://doi.org/10.1016/j.tcs.2004.09.006openalex-snapshot
Synchronizing generalized monotonic automata
inferredcites →https://doi.org/10.1016/j.tcs.2006.02.003openalex-snapshot
Synchronizing groups and automata
inferredcites →https://doi.org/10.1016/j.tcs.2009.01.038openalex-snapshot
Collapsing words, permutation conditions and coherent colorings of trees
inferredcites →https://doi.org/10.1016/j.tcs.2009.03.021openalex-snapshot
Synchronizing automata preserving a chain of partial orders
inferredcites →https://doi.org/10.1016/j.tcs.2009.06.005openalex-snapshot
Shortest synchronizing strings for Huffman codes
inferredcites →https://doi.org/10.1016/j.tcs.2011.06.012openalex-snapshot
The Černý conjecture for one-cluster automata with prime length cycle
inferredcites →https://doi.org/10.1016/j.tcs.2015.10.045openalex-snapshot
Recognizing 3-collapsing words over a binary alphabet
inferredcites →https://doi.org/10.1016/j.tcs.2016.09.026openalex-snapshot
Ideal regular languages and strongly connected synchronizing automata
inferredcites →https://doi.org/10.1016/j.tcs.2018.12.026openalex-snapshot
Synchronization problems in automata without non-trivial cycles
inferredcites →https://doi.org/10.1016/j.tcs.2021.08.030openalex-snapshot
Constrained synchronization and commutativity
inferredcites →https://doi.org/10.1016/s0019-9958(61)80003-xopenalex-snapshot
State-identification experiments in finite automata
inferredcites →https://doi.org/10.1016/s0022-0000(73)80010-8openalex-snapshot
Establishing certain bounds concerning finite automata
inferredcites →https://doi.org/10.1016/s0195-6698(82)80025-5openalex-snapshot
An Extremal Problem for two Families of Sets
inferredcites →https://doi.org/10.1016/s0304-0208(08)73432-7openalex-snapshot
On two Combinatorial Problems Arising from Automata Theory
inferredcites →https://doi.org/10.1016/s0304-3975(01)00227-4openalex-snapshot
Composition sequences for functions over a finite domain
inferredcites →https://doi.org/10.1016/s0304-3975(02)00405-xopenalex-snapshot
Synchronizing finite automata on Eulerian digraphs
inferredcites →https://doi.org/10.1016/s0304-3975(96)00136-3openalex-snapshot
Reset words for commutative and solvable automata
inferredcites →https://doi.org/10.1038/35106533openalex-snapshot
Programmable and autonomous computing machine made of biomolecules
inferredcites →https://doi.org/10.1051/ita/1998321-300211openalex-snapshot
Sur les automates circulaires et la conjecture de Černý
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1073/pnas.0535624100openalex-snapshot
DNA molecule provides a computing machine with both data and fuel
inferredcites →https://doi.org/10.1090/s0002-9947-08-04712-0openalex-snapshot
Representation theory of finite semigroups, semigroup radicals and formal language theory
inferredcites →https://doi.org/10.1090/s0002-9947-1900-1500428-3openalex-snapshot
Errata: “On certain crinkly curves” [Trans. Amer. Math. Soc. 1 (1900), no. 1, 72–90; 1500526]
inferredcites →https://doi.org/10.1090/s0002-9947-1900-1500526-4openalex-snapshot
On Certain Crinkly Curves
inferredcites →https://doi.org/10.1093/acprof:oso/9780198568209.001.0001openalex-snapshot
The Diophantine Frobenius Problem
inferredcites →https://doi.org/10.1109/18.9779openalex-snapshot
On the characterization of statistically synchronizable variable-length codes
inferredcites →https://doi.org/10.1109/43.298038openalex-snapshot
Exact calculation of synchronizing sequences based on binary decision diagrams
inferredcites →https://doi.org/10.1109/70.406944openalex-snapshot
Manipulating algebraic parts in the plane
inferredcites →https://doi.org/10.1109/dcc.2008.23openalex-snapshot
Guaranteed Synchronization of Huffman Codes
inferredcites →https://doi.org/10.1109/dcc.2009.18openalex-snapshot
Guaranteed Synchronization of Huffman Codes with Known Position of Decoder
inferredcites →https://doi.org/10.1109/edac.1993.386426openalex-snapshot
Multiple observation time single reference test generation using synchronizing sequences
inferredcites →https://doi.org/10.1109/iros45743.2020.9341344openalex-snapshot
Virtual Reality for Robots
inferredcites →https://doi.org/10.1109/pgec.1963.263600openalex-snapshot
Determination of the Final State of an Automaton Whose Initial State Is Unknown
inferredcites →https://doi.org/10.1109/sfcs.1977.16openalex-snapshot
Lower bounds for natural proof systems
inferredcites →https://doi.org/10.1109/sfcs.1986.5openalex-snapshot
An algorithmic approach to the automated design of parts orienters
inferredcites →https://doi.org/10.1109/swat.1970.22openalex-snapshot
Synchronizing and representation problems for sequential machines with masked outputs
inferredcites →https://doi.org/10.1109/tit.1956.1056809openalex-snapshot
On an application of semi groups methods to some problems in coding
inferredcites →https://doi.org/10.1134/s0001434611090094openalex-snapshot
Slowly synchronizing automata with zero and noncomplete sets
inferredcites →https://doi.org/10.1137/0219033openalex-snapshot
Reset Sequences for Monotonic Automata
inferredcites →https://doi.org/10.1142/9789812702616_0002openalex-snapshot
SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
inferredcites →https://doi.org/10.1142/9789812794499_others05openalex-snapshot
Formal Language Theory
inferredcites →https://doi.org/10.1142/9789812810168_0007openalex-snapshot
COMPOSITIONS OVER A FINITE DOMAIN: FROM COMPLETENESS TO SYNCHRONIZABLE AUTOMATA
inferredcites →https://doi.org/10.1142/s0129054106003966openalex-snapshot
COLLAPSING WORDS: A PROGRESS REPORT
inferredcites →https://doi.org/10.1142/s0129054111008039openalex-snapshot
A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA
inferredcites →https://doi.org/10.1142/s012905411100888xopenalex-snapshot
ON A CONJECTURE BY CARPI AND D'ALESSANDRO
inferredcites →https://doi.org/10.1142/s0129054111008970openalex-snapshot
THE AVERAGING TRICK AND THE ČERNÝ CONJECTURE
inferredcites →https://doi.org/10.1142/s0129054113400157openalex-snapshot
SYNCHRONIZING QUASI-EULERIAN AND QUASI-ONE-CLUSTER AUTOMATA
inferredcites →https://doi.org/10.1142/s0129054116400037openalex-snapshot
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory
inferredcites →https://doi.org/10.1142/s0129054119400057openalex-snapshot
On the Interplay Between Černý and Babai’s Conjectures
inferredcites →https://doi.org/10.1142/s0129054119400343openalex-snapshot
Reset Complexity of Ideal Languages Over a Binary Alphabet
inferredcites →https://doi.org/10.1142/s0218196795000185openalex-snapshot
RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS
inferredcites →https://doi.org/10.1142/s0219498803000519openalex-snapshot
PROFINITE IDENTITIES FOR FINITE SEMIGROUPS WHOSE SUBGROUPS BELONG TO A GIVEN PSEUDOVARIETY
inferredcites →https://doi.org/10.1145/320932.320938openalex-snapshot
On the Length of the Smallest Uniform Experiment which Distinguishes the Terminal States of a Machine
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.1177/027836498900800607openalex-snapshot
Some Paradigms for the Automated Design of Parts Feeders
inferredcites →https://doi.org/10.13140/rg.2.2.20208.66561openalex-snapshot
The length of a minimal synchronizing word and the Černy conjecture
inferredcites →https://doi.org/10.1515/9781400882618-002openalex-snapshot
Representation of Events in Nerve Nets and Finite Automata
inferredcites →https://doi.org/10.1515/9781400882618-006openalex-snapshot
Gedanken-Experiments on Sequential Machines
inferredcites →https://doi.org/10.21236/ad0401924openalex-snapshot
STUDY ON APPLICATION OF CODING THEORY
inferredcites →https://doi.org/10.23638/dmtcs-19-1-17openalex-snapshot
A class of symmetric difference-closed sets related to commuting involutions
inferredcites →https://doi.org/10.25596/jalc-2019-123openalex-snapshot
A Note on Homogeneous Experiments with Finite Automata
inferredcites →https://doi.org/10.25596/jalc-2019-133openalex-snapshot
A Remark About Homogeneous Experiments
inferredcites →https://doi.org/10.25596/jalc-2019-139openalex-snapshot
Implementation of the Algorithm for Testing an Automaton for Synchronization in Linear Expected Time
inferredcites →https://doi.org/10.25596/jalc-2019-153openalex-snapshot
A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink
inferredcites →https://doi.org/10.25596/jalc-2019-165openalex-snapshot
Locally Strongly Transitive Automata in the Černý Conjecture and Related Problems
inferredcites →https://doi.org/10.25596/jalc-2019-253openalex-snapshot
Counting Symbol Switches in Synchronizing Automata
inferredcites →https://doi.org/10.25596/jalc-2019-309openalex-snapshot
Missing Factors of Ideals and Synchronizing Automata
inferredcites →https://doi.org/10.25596/jalc-2019-343openalex-snapshot
The Černý Conjecture Holds with High Probability
inferredcites →https://doi.org/10.25596/jalc-2019-367openalex-snapshot
An Improvement to a Recent Upper Bound for Synchronizing Words of Finite Automata
inferredcites →https://doi.org/10.25596/jalc-2019-375openalex-snapshot
Slowly Synchronizing Automata with Idempotent Letters of Low Rank
inferredcites →https://doi.org/10.3103/s1066369x10010019openalex-snapshot
The annulation threshold for partially monotonic automata
inferredcites →https://doi.org/10.3217/jucs-008-02-0332openalex-snapshot
Generation of Constants and Synchronization of Finite Automata
inferredcites →https://doi.org/10.3233/fi-2014-1034openalex-snapshot
Principal Ideal Languages and Synchronizing Automata
inferredcites →https://doi.org/10.3233/fi-2016-1357openalex-snapshot
Approximation of Reset Thresholds with Greedy Algorithms
inferredcites →https://doi.org/10.3233/fi-2018-1720openalex-snapshot
Trim Strongly Connected Synchronizing Automata and Ideal Languages
inferredcites →https://doi.org/10.3390/a10010024openalex-snapshot
Problems on Finite Automata and the Exponential Time Hypothesis
inferredcites →https://doi.org/10.4171/automata-1/15openalex-snapshot
Černý’s conjecture and the road colouring problem
inferredcites →https://doi.org/10.4171/emss/4-2-1openalex-snapshot
Between primitive and 2-transitive: Synchronization and its friends
inferredcites →https://doi.org/10.4213/mzm6191openalex-snapshot
Медленно синхронизируемые автоматы с нулем и непокрывающие множества
inferredcites →https://doi.org/10.4230/lipics.mfcs.2017.40openalex-snapshot
Attainable Values of Reset Thresholds
inferredcites →https://doi.org/10.4230/lipics.mfcs.2018.21openalex-snapshot
Finding Short Synchronizing Words for Prefix Codes
inferredcites →https://doi.org/10.4230/lipics.mfcs.2019.48openalex-snapshot
Computational Complexity of Synchronization under Regular Constraints
inferredcites →https://doi.org/10.46298/dmtcs.2101openalex-snapshot
A note on a recent attempt to improve the Pin-Frankl bound
inferredcites →https://doi.org/10.46298/dmtcs.2103openalex-snapshot
Parameterized complexity of synchronization and road coloring
inferredcites →https://doi.org/10.46298/dmtcs.395openalex-snapshot
The \v Cerný conjecture for aperiodic automata
inferredcites →https://doi.org/10.46298/dmtcs.463openalex-snapshot
On the length of shortest 2-collapsing words
inferredcites →https://doi.org/10.46298/dmtcs.619openalex-snapshot
The Cerný conjecture for automata respecting intervals of a directed graph
inferredcites →https://doi.org/10.48550/arxiv.1702.05455openalex-snapshot
Improving the upper bound on the length of the shortest reset words
inferredcites →https://doi.org/10.48550/arxiv.2003.06177openalex-snapshot
Cerny-Starke conjecture from the sixties of XX century
inferredcites →https://doi.org/10.48550/arxiv.2006.01903openalex-snapshot
On a Class of Constrained Synchronization Problems in NP
inferredcites →https://doi.org/10.5962/bhl.title.5851openalex-snapshot
An introduction to cybernetics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4819005openalex-extracted
Cornering Robots to Synchronize a Dfa
inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115864openalex-snapshot
A cornering strategy for synchronizing a DFA
inferred← citeshttps://doi.org/10.20295/2412-9186-2026-12-01-73-81openalex-snapshot
Stochastic Synchronization of Fuzzy Finite 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.