Pages that link to "Item:Q1853731"
From MaRDI portal
The following pages link to Squaring transducers: An efficient procedure for deciding functionality and sequentiality. (Q1853731):
Displaying 34 items.
- An optimal pre-determinization algorithm for weighted transducers (Q703490) (← links)
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577) (← links)
- Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring (Q764364) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Efficient algorithms for computing the inner edit distance of a regular language via transducers (Q1712004) (← links)
- Lexicographic decomposition of \(k\)-valued transducers (Q1959399) (← links)
- Finite sequentiality of unambiguous max-plus tree automata (Q2048206) (← links)
- Space-efficient bimachine construction based on the equalizer accumulation principle (Q2272386) (← links)
- On long words avoiding Zimin patterns (Q2321925) (← links)
- Sequential? (Q2490822) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Implementation of Code Properties via Transducers (Q2830220) (← links)
- FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION (Q2909182) (← links)
- Equivalence Checking Problem for Finite State Transducers over Semigroups (Q2947161) (← links)
- Multi-sequential Word Relations (Q3451110) (← links)
- On the continuity set of an Omega rational function (Q3514642) (← 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)
- Multi-Sequential Word Relations (Q4640041) (← links)
- (Q5005148) (← links)
- Crisp-determinization of weighted tree automata over strong bimonoids (Q5038197) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- (Q5090448) (← links)
- (Q5090506) (← links)
- (Q5092330) (← links)
- On Synthesis of Resynchronizers for Transducers (Q5092432) (← links)
- (Q5376652) (← links)
- FINITELY SUBSEQUENTIAL TRANSDUCERS (Q5696948) (← links)
- Over Which Monoids is the Transducer Determinization Procedure Applicable? (Q5739012) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)
- Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels (Q5859660) (← links)
- Decidable weighted expressions with Presburger combinators (Q5915759) (← links)
- Transducing reversibly with finite state machines (Q5919580) (← links)
- Two Effective Properties of ω-Rational Functions (Q6169907) (← links)
