Pages that link to "Item:Q4680729"
From MaRDI portal
The following pages link to Similarity relations and cover automata (Q4680729):
Displayed 7 items.
- A sufficient condition to polynomially compute a minimum separating DFA (Q2282132) (← links)
- More on deterministic and nondeterministic finite cover automata (Q2357103) (← links)
- More on Deterministic and Nondeterministic Finite Cover Automata (Q2947414) (← links)
- Reducing Acyclic Cover Transducers (Q3503893) (← links)
- UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION (Q4923276) (← links)
- Computing All ℓ-Cover Automata Fast (Q5200065) (← links)
- COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN (Q5704369) (← links)