Subset mapping problems in solvable automata
From MaRDI portal
Cites work
- A counter example to a conjecture concerning synchronizing words in finite automata
- A multi-parameter analysis of hard problems on deterministic finite automata
- A note on homogeneous experiments with finite automata
- A remark about homogeneous experiments
- Alternation Elimination by Complementation (Extended Abstract)
- An improvement to a recent upper bound for synchronizing words of finite automata
- Automata with finite congruence lattices
- Cascade synthesis of finite-state machines
- Classifying regular languages via cascade products of automata
- Commutative Positive Varieties of Languages
- Completely reachable automata
- Completely Reachable Automata: An Interplay Between Automata, Graphs, and Trees
- Complexities of some problems related to synchronizing, non-synchronizing and monotonic automata
- Complexity of universality and related problems for partially ordered NFAs
- Constrained synchronization and commutativity
- Constrained synchronization and subset synchronization problems for weakly acyclic automata
- Counting quantifiers, successor relations, and logarithmic space
- Deciding Universality of ptNFAs is PSpace-Complete
- Extensions to minimal synchronizing words
- Frontiers of tractability for typechecking simple XML transformations
- Hardness results for intersection non-emptiness
- Hierarchies of complete problems
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- scientific article; zbMATH DE number 4028925 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3744555 (Why is no real title available?)
- scientific article; zbMATH DE number 3767049 (Why is no real title available?)
- scientific article; zbMATH DE number 3767050 (Why is no real title available?)
- scientific article; zbMATH DE number 3554180 (Why is no real title available?)
- scientific article; zbMATH DE number 3609145 (Why is no real title available?)
- scientific article; zbMATH DE number 1759492 (Why is no real title available?)
- scientific article; zbMATH DE number 1775632 (Why is no real title available?)
- scientific article; zbMATH DE number 2087227 (Why is no real title available?)
- scientific article; zbMATH DE number 809137 (Why is no real title available?)
- scientific article; zbMATH DE number 871949 (Why is no real title available?)
- scientific article; zbMATH DE number 897906 (Why is no real title available?)
- scientific article; zbMATH DE number 7152073 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3225363 (Why is no real title available?)
- scientific article; zbMATH DE number 3328165 (Why is no real title available?)
- Intersection non-emptiness and hardness within polynomial time
- Isomorphism Groups of Automata
- Languages of R-trivial monoids
- Learning commutative deterministic finite state automata in polynomial time
- Learning Commutative Regular Languages
- Matrix Mortality and the Černý-Pin Conjecture
- Membership testing in commutative transformation semigroups
- Model-based testing of reactive systems. Advanced lectures.
- New characterizations of primitive permutation groups with applications to synchronizing automata
- On semi-groups.
- On the complexity of intersection non-emptiness for star-free language classes
- On the computational complexity of problems related to distinguishability sets
- On the State and Computational Complexity of the Reverse of Acyclic Minimal DFAs
- ON THE THEORY OF EPIGROUPS. I
- Orienting polygonal parts without sensors
- Parallel algorithms for solvable permutation groups
- Partially ordered automata and piecewise testability
- Partially ordered two-way Büchi automata
- Permutation automata
- Polynomial complete problems in automata theory
- Preimage problems for deterministic finite automata
- Problems complete for deterministic logarithmic space
- Problems on finite automata and the exponential time hypothesis
- RANK PROBLEMS FOR COMPOSITE TRANSFORMATIONS
- Regularity Conditions for Iterated Shuffle on Commutative Regular Languages
- Regularity conditions for iterated shuffle on commutative regular languages
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- SOME RESULTS ON ČERNÝ TYPE PROBLEMS FOR TRANSFORMATION SEMIGROUPS
- Space-bounded reducibility among combinatorial problems
- State complexity bounds for projection, shuffle, up- and downward closure and interior on commutative regular languages
- Subset synchronization and careful synchronization of binary finite automata
- Subset synchronization in monotonic automata
- Synchronization of finite automata
- Synchronization problems in automata without non-trivial cycles
- Synchronizing Automata and the Černý Conjecture
- Synchronizing generalized monotonic automata
- Synchronizing monotonic automata
- Synchronizing times for k-sets in automata
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
- The complexity of intersecting finite automata having few final states
- The synchronization game on subclasses of automata
- Towards a complexity theory of synchronous parallel computation
- Winning strategies for the synchronization game on subclasses of finite automata
- Words of minimum rank in deterministic finite automata
- Černý's conjecture and the road colouring problem
This page was built for publication: Subset mapping problems in solvable automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907609)
