Pages that link to "Item:Q2527943"
From MaRDI portal
The following pages link to Multitape one-way nonwriting automata (Q2527943):
Displayed 40 items.
- Synchronized rational relations of finite and infinite words (Q685453) (← links)
- Limitedness theorem on finite automata with distance functions: An algebraic proof (Q807031) (← links)
- On the power of synchronization in parallel computations (Q811118) (← links)
- Two-way non-uniform finite automata (Q832933) (← links)
- Separability of rational relations in \(A^* \times \mathbb N^m\) by recognizable relations is decidable (Q845664) (← links)
- New techniques for proving the decidability of equivalence problem (Q913523) (← links)
- Small overlap monoids. II: Automatic structures and normal forms. (Q1024392) (← links)
- Rational equivalence relations (Q1089801) (← links)
- The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
- Hierarchies of one-way multihead automata languages (Q1099645) (← links)
- Multihead one-way finite automata (Q1183574) (← links)
- On the decidability of the equivalence problem for partially commutative rational power series (Q1193904) (← links)
- Marker automata (Q1231894) (← links)
- Finite automata with multiplication (Q1233317) (← links)
- Modelization of deterministic rational relations (Q1603699) (← links)
- On the representation of finite deterministic 2-tape automata (Q1960654) (← links)
- Automata and rational expressions (Q2074204) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata (Q2271426) (← links)
- Quasi-automatic semigroups (Q2422022) (← links)
- Sequential? (Q2490822) (← links)
- Finite-turn checking automata (Q2550634) (← links)
- Both Ways Rational Functions (Q2817380) (← links)
- Decision problems among the main subfamilies of rational relations (Q3431438) (← links)
- On the Decidability of the Equivalence for k-Valued Transducers (Q3533016) (← links)
- On the Decidability of the Equivalence for a Certain Class of Transducers (Q3637249) (← links)
- Restricted one-counter machines with undecidable universe problems (Q3864502) (← links)
- (Q4113762) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- (Q5089196) (← links)
- (Q5090448) (← links)
- (Q5091265) (← links)
- (Q5092324) (← links)
- On Synthesis of Resynchronizers for Transducers (Q5092432) (← links)
- An Automata Theoretic Approach to Rational Tree Relations (Q5448669) (← links)
- Learners based on transducers (Q5918614) (← links)
- Transducing reversibly with finite state machines (Q5919580) (← links)
- Abstract families of relations (Q5921426) (← links)
- Determinism and Nondeterminism in Finite Automata with Advice (Q6163614) (← links)
- Two-Way Non-Uniform Finite Automata (Q6169962) (← links)