Pages that link to "Item:Q5200081"
From MaRDI portal
The following pages link to Decidability and Shortest Strings in Formal Languages (Q5200081):
Displaying 3 items.
- On the Length of Shortest Strings Accepted by Two-way Finite Automata (Q5158651) (← links)
- Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification (Q6160567) (← links)
- Shortest accepted strings for two-way finite automata: approaching the \(2^n\) lower bound (Q6175095) (← links)
