Synchronizing series-parallel deterministic finite automata with loops and related problems
From MaRDI portal
Publication:5021111
Recommendations
- Careful synchronization of partial deterministic finite automata
- scientific article; zbMATH DE number 1953272
- Synchronization of finite automata
- Synchronizing non-deterministic finite automata
- On Parallel Implementations of Deterministic Finite Automata
- Synchronization of Parikh automata
- Synchronizing automata with coinciding cycles
- New results concerning synchronized finite automata
- Asynchronous systems of parallel communicating finite automata
- Synchronization and stability of finite automata
Cites work
- scientific article; zbMATH DE number 5999572 (Why is no real title available?)
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- scientific article; zbMATH DE number 1206597 (Why is no real title available?)
- scientific article; zbMATH DE number 1775632 (Why is no real title available?)
- scientific article; zbMATH DE number 6157240 (Why is no real title available?)
- scientific article; zbMATH DE number 7152073 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- scientific article; zbMATH DE number 3354928 (Why is no real title available?)
- A multi-parameter analysis of hard problems on deterministic finite automata
- A note on homogeneous experiments with finite automata
- A quadratic upper bound on the size of a synchronizing word in one-cluster automata
- An extremal problem for two families of sets
- An improvement to a recent upper bound for synchronizing words of finite automata
- Analytical approach to parallel repetition
- Are there any good digraph width measures?
- Comparing linear width parameters for directed graphs
- Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
- Complexity of a problem concerning reset words for Eulerian binary automata
- Complexity of problems concerning reset words for cyclic and Eulerian automata
- Complexity of problems concerning reset words for some partial cases of automata
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Computing the shortest reset words of synchronizing automata
- Digraphs of bounded elimination width
- Digraphs of bounded width
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling
- Extensions to minimal synchronizing words
- Fundamentals of parameterized complexity
- Languages of R-trivial monoids
- Model-based testing of reactive systems. Advanced lectures.
- Modern aspects of complexity within formal languages
- On the parameterized complexity of short computation and factorization
- On the synchronization of planar automata
- On two Combinatorial Problems Arising from Automata Theory
- Parallel recognition of series-parallel graphs
- Parameterized algorithms
- Parameterized complexity and approximability of the longest compatible sequence problem
- Parameterized complexity of synchronization and road coloring
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- Semicomputable points in Euclidean spaces
- Series parallel digraphs with loops
- Some consequences of non-uniform conditions on uniform classes
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata preserving a chain of partial orders
- Synchronizing automata with finitely many minimal synchronizing words
- Synchronizing finite automata on Eulerian digraphs.
- Synchronizing words and monoid factorization: a parameterized perspective
- The Recognition of Series Parallel Digraphs
- The parameterized complexity of sequence alignment and consensus
- The Černý conjecture for one-cluster automata with prime length cycle
Cited in
(6)- Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
- Speedups of deterministic machines by synchronous parallel machines
- Synchronizing words and monoid factorization: a parameterized perspective
- A multi-parameter analysis of hard problems on deterministic finite automata
- A multivariate analysis of some DFA problems
This page was built for publication: Synchronizing series-parallel deterministic finite automata with loops and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5021111)
