Pages that link to "Item:Q1838038"
From MaRDI portal
The following pages link to Polynomial complete problems in automata theory (Q1838038):
Displayed 23 items.
- On the complexity of existence of homing sequences for nondeterministic finite state machines (Q300305) (← links)
- The relation between preset distinguishing sequences and synchronizing sequences (Q736851) (← links)
- Constrained synchronization and subset synchronization problems for weakly acyclic automata (Q832939) (← links)
- Problems on finite automata and the exponential time hypothesis (Q1662614) (← links)
- Rank of a finite automaton (Q1816131) (← links)
- Reset complexity and completely reachable automata with simple idempotents (Q2112183) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- Constrained synchronization and commutativity (Q2235741) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Using SAT solvers for synchronization issues in non-deterministic automata (Q2633380) (← links)
- Synchronizing Automata over Nested Words (Q2811343) (← links)
- Problems on Finite Automata and the Exponential Time Hypothesis (Q2830210) (← links)
- Weak equivalence of automata (Q4007436) (← links)
- Complexity of Preimage Problems for Deterministic Finite Automata (Q5005132) (← links)
- Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
- (Q5089200) (← links)
- Semicomputable points in Euclidean spaces (Q5092426) (← links)
- D2-SYNCHRONIZATION IN NONDETERMINISTIC AUTOMATA (Q5125223) (← links)
- Complexities of Some Problems Related to Synchronizing, Non-Synchronizing and Monotonic Automata (Q5250279) (← links)
- Synchronization problems in automata without non-trivial cycles (Q5919579) (← links)
- Synchronizing words under \textsf{LTL} constraints (Q6161453) (← links)
- Synchronizing deterministic push-down automata can be really hard (Q6186317) (← links)