Pages that link to "Item:Q685453"

The following pages link to Synchronized rational relations of finite and infinite words (Q685453):

Displaying 40 items.

• On factors of synchronized sequences (Q410714) (← links)
• Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. (Q479731) (← links)
• Deciding word neighborhood with universal neighborhood automata (Q533878) (← links)
• Regular languages of nested words: fixed points, automata, and synchronization (Q649107) (← links)
• Second-order finite automata: expressive power and simple proofs using automatic structures (Q832943) (← links)
• Prognosis of \(\omega\)-languages for the diagnosis of *-languages: a topological perspective (Q843994) (← links)
• Linearly bounded infinite graphs (Q852011) (← links)
• The growth ratio of synchronous rational relations is unique (Q880172) (← links)
• Synchronizing relations on words (Q905682) (← links)
• Semi-synchronous transductions (Q1006891) (← links)
• Deterministic synchronization of automata with bounded delay (Q1127313) (← links)
• A construction on finite automata that has remained hidden (Q1275469) (← links)
• On the transition graphs of Turing machines. (Q1401268) (← links)
• The homomorphism problem for trace monoids. (Q1426045) (← links)
• How to decide continuity of rational functions on infinite words (Q1589419) (← links)
• Distances between languages and reflexivity of relations (Q1608895) (← links)
• Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\) (Q1633382) (← links)
• The monoid of queue actions (Q1702520) (← links)
• Families of automata characterizing context-sensitive languages (Q1772107) (← links)
• Automaticity of ordinals and of homogeneous graphs (Q1876889) (← links)
• On the representation of finite deterministic 2-tape automata (Q1960654) (← links)
• Feasible reductions to Kolmogorov-Loveland stochastic sequences (Q1960665) (← links)
• On finite complete rewriting systems, finite derivation type, and automaticity for homogeneous monoids (Q2013556) (← links)
• Uniform strategies, rational relations and jumping automata (Q2346407) (← links)
• On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
• Automatic quotients of free groups. (Q2570182) (← links)
• (Q2842874) (← links)
• On the automaticity of singular Artin monoids of finite type (Q2855750) (← links)
• Multi-dimensional sets recognizable in all abstract numeration systems (Q2911426) (← links)
• On synchronized sequences and their separators (Q3147019) (← links)
• Regular Growth Automata: Properties of a Class of Finitely Induced Infinite Machines (Q3172836) (← links)
• (Q3386623) (← links)
• Undecidability of Topological and Arithmetical Properties of Infinitary Rational Relations (Q4825476) (← links)
• (Q5002830) (← links)
• (Q5079723) (← links)
• Closure properties of synchronized relations (Q5090470) (← links)
• (Q5091265) (← links)
• (Q5136335) (← links)
• Automata, Borel functions and real numbers in Pisot base (Q5444100) (← links)
• Two Effective Properties of ω-Rational Functions (Q6169907) (← links)