Pages that link to "Item:Q2542993"

The following pages link to Sets recognized by n-tape automata (Q2542993):

Displaying 14 items.

• Rational relations having a rational trace on each finite intersection of rational relations (Q714813) (← links)
• Calvin C. Elgot (1922-1980) (Q788706) (← links)
• The decision problem for some logics for finite words on infinite alphabets (Q843605) (← links)
• Finite \(n\)-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al. (Q1001895) (← links)
• In memoriam Calvin C. Elgot (Q1154455) (← links)
• The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
• Quasi-automatic semigroups (Q2422022) (← links)
• Multi-dimensional sets recognizable in all abstract numeration systems (Q2911426) (← links)
• Decision problems among the main subfamilies of rational relations (Q3431438) (← links)
• Automata Presenting Structures: A Survey of the Finite String Case (Q3503740) (← links)
• AN APPLICATION OF FIRST-ORDER LOGIC TO THE STUDY OF RECOGNIZABLE LANGUAGES (Q4658712) (← links)
• Learning two-tape automata from queries and counterexamples (Q4879209) (← links)
• The Quantifier Alternation Hierarchy of Synchronous Relations (Q5092389) (← links)
• Graph Logics with Rational Relations (Q5278208) (← links)