Pages that link to "Item:Q1622980"
From MaRDI portal
The following pages link to On completely reachable automata and subset reachability (Q1622980):
Displaying 9 items.
- A characterization of completely reachable automata (Q1622956) (← links)
- Preimage problems for deterministic finite automata (Q2208257) (← links)
- THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA (Q3646172) (← links)
- (Q4782023) (← links)
- The Length of Subset Reachability in Nondeterministic Automata (Q4982094) (← links)
- Hardly reachable subsets and completely reachable automata with 1-deficient words (Q5208375) (← links)
- (Q5216326) (← links)
- Turing-Complete Subclasses of CHR (Q5504695) (← links)
- Binary completely reachable automata (Q6109017) (← links)