Pages that link to "Item:Q3968472"
From MaRDI portal
The following pages link to A note on finite-valued and finitely ambiguous transducers (Q3968472):
Displayed 16 items.
- Efficient constructions of test sets for regular and context-free languages (Q685373) (← links)
- The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
- Deciding the immutability of regular codes and languages under finite transduction (Q1120291) (← links)
- Prefix and equality languages of rational functions are co-context-free (Q1124356) (← links)
- On the finite-valuedness problem for sequential machines (Q1173410) (← links)
- There does not exist an enumerable family of context-free grammars that generates the class of single-valued languages (Q1177785) (← links)
- Transforming a single-valued transducer into a Mealy machine (Q1267709) (← links)
- On the lengths of values in a finite transducer (Q1323379) (← links)
- Finite-valued distance automata (Q1341750) (← links)
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality. (Q1853731) (← links)
- Lexicographic decomposition of \(k\)-valued transducers (Q1959399) (← links)
- Decomposing a $k$-valued transducer into $k$ unambiguous ones (Q3126010) (← links)
- On the Decidability of the Equivalence for k-Valued Transducers (Q3533016) (← links)
- Deterministic realization of nondeterministic computations with a low measure of nondeterminism (Q4007372) (← links)
- The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)
- FINITELY SUBSEQUENTIAL TRANSDUCERS (Q5696948) (← links)