The following pages link to Regular prefix relations (Q3763605):
Displaying 6 items.
- Rational relations having a rational trace on each finite intersection of rational relations (Q714813) (← links)
- Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895) (← links)
- The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
- Deciding Whether or Not a Synchronous Relation is Regular Prefix (Q2934880) (← links)
- Learning two-tape automata from queries and counterexamples (Q4879209) (← links)
- Resynchronized uniformization and definability problems for rational relations (Q6599794) (← links)