scientific article; zbMATH DE number 3222112

Recommendations

A note on homogeneous experiments with finite automata
scientific article; zbMATH DE number 4041277
scientific article; zbMATH DE number 4011948
Indistinguishability of finite automata by multiple experiments in a stationary observation medium
scientific article; zbMATH DE number 1165603
scientific article; zbMATH DE number 1537560
Experiments with automata when the upper bound of the number of their states is unknown
scientific article; zbMATH DE number 3868626
Topological properties of experiments on automata

Cited in

(only showing first 100 items - show all)

On synchronizing unambiguous automata
Image reducing words and subgroups of free groups.
Experiments with automata when the upper bound of the number of their states is unknown
Strongly connected synchronizing automata and the language of minimal reset words
Problems on finite automata and the exponential time hypothesis
Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
Some contributions to the theory of transformation monoids
The complexity of synchronizing Markov decision processes
Synchronizing generalized monotonic automata
A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number
Computational complexity of synchronization under regular commutative constraints
Simplicity of augmentation submodules for transformation monoids
Slowly synchronizing automata with fixed alphabet size
Extremal synchronizing circular automata
Synchronizing words for real-time deterministic pushdown automata (extended abstract)
Sync-maximal permutation groups equal primitive permutation groups
Reset complexity and completely reachable automata with simple idempotents
Distributed graph problems through an automata-theoretic Lens
Cerny's conjecture for automata with simple idempotents
Computational complexity of synchronization under sparse regular constraints
Some results concerning careful synchronization of partial automata and subset synchronization of DFA's
Constrained synchronization for monotonic and solvable automata and automata with simple idempotents
Careful synchronization of partial deterministic finite automata
Synchronizing sequences for road colored digraphs
Preimage problems for deterministic finite automata
Completely reachable automata, primitive groups and the state complexity of the set of synchronizing words
State complexity of the set of synchronizing words for circular automata and automata over binary alphabets
Constrained synchronization and commutativity
A multi-parameter analysis of hard problems on deterministic finite automata
Černý's conjecture and group representation theory
Existence of constants in regular splicing languages
Computing the shortest reset words of synchronizing automata
Reaching the minimum ideal in a finite semigroup
Synchronizing groups and automata
Distributed graph problems through an automata-theoretic lens
Ideal separation and general theorems for constrained synchronization and their application to small constraint automata
On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
On the synchronizing probability function and the triple rendezvous time for synchronizing automata
Synchronizing automata on quasi-Eulerian digraph
Synchronizing automata of bounded rank
Synchronization of automata with one undefined or ambiguous transition
Emergence on decreasing sandpile models
On the Number of Synchronizing Colorings of Digraphs
Describing homing and distinguishing sequences for nondeterministic finite state machines via synchronizing automata
The Černý conjecture and 1-contracting automata
Primitive sets of nonnegative matrices and synchronizing automata
Representation of (left) ideal regular languages by synchronizing automata
Ideal regular languages and strongly connected synchronizing automata
On synchronizing tree automata and their work-optimal parallel run, usable for parallel tree pattern matching
Surface dimension, tiles, and synchronizing automata
scientific article; zbMATH DE number 7228447 (Why is no real title available?)
Synchronizing Automata Preserving a Chain of Partial Orders
The Synchronization Problem for Strongly Transitive Automata
Synchronizing Automata and the Černý Conjecture
2-Synchronizing Words
Shortest Synchronizing Strings for Huffman Codes
Representation theory of finite semigroups, semigroup radicals and formal language theory
Matrix Mortality and the Černý-Pin Conjecture
scientific article; zbMATH DE number 5630707 (Why is no real title available?)
A graph theoretic approach to automata minimality
Les automates circulaires biaisés vérifient la conjecture de Černý
Complexity of problems concerning reset words for cyclic and Eulerian automata
Recent results on syntactic groups of prefix codes.
The length of subset reachability in nondeterministic automata
Complexity of preimage problems for deterministic finite automata
On randomized generation of slowly synchronizing automata
Synchronizing series-parallel deterministic finite automata with loops and related problems
Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
Semicomputable points in Euclidean spaces
Černý conjecture for edge-colored digraphs with few junctions
On the length of uncompletable words in unambiguous automata
Attainable values of reset thresholds
A note on polynomial approximation of synchronizing optimal coloring
On the local invertibility of finite state automata without information loss
Complexity of a problem concerning reset words for Eulerian binary automata
On incomplete and synchronizing finite sets
Reset complexity of ideal languages over a binary alphabet
Lower bounds for synchronizing word lengths in partial automata
On the interplay between Černý and Babai's conjectures
Lower Bound for the Length of Synchronizing Words in Partially-Synchronizing Automata
Synchronizing automata with finitely many minimal synchronizing words
scientific article; zbMATH DE number 3294598 (Why is no real title available?)
The Synchronizing Probability Function for Primitive Sets of Matrices
Synchronizing almost-group automata
Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
Estimation of the length of reset words for automata with simple idempotents
Synchronization of Parikh automata
Synchronizing automata with coinciding cycles
Synchronizing Boolean networks asynchronously
On the meeting of random walks on random DFA
Synchronizing words under \textsf{LTL} constraints
Normalish Amenable Subgroups of the R. Thompson Groups
Extremal Binary PFAs with Small Number of States
Fast synchronization of inhomogenous random automata
On the smallest synchronizing terms of finite tree automata
On the smallest synchronizing terms of finite tree automata
Reset sink complexity of regular ideals
Short synchronizing words for random automata
An improved algorithm for finding the shortest synchronizing words
Careful synchronization of one-cluster automata

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5509690)