Pages that link to "Item:Q3968472"
From MaRDI portal
The following pages link to A note on finite-valued and finitely ambiguous transducers (Q3968472):
Displaying 35 items.
- On the containment and equivalence problems for two-way transducers (Q418777) (← links)
- Static analysis of XML security views and query rewriting (Q462481) (← links)
- 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)
- Visibly pushdown transducers (Q1672009) (← links)
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality. (Q1853731) (← links)
- Lexicographic decomposition of \(k\)-valued transducers (Q1959399) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Formal descriptions of code properties: decidability, complexity, implementation (Q2909182) (← links)
- Equivalence Checking Problem for Finite State Transducers over Semigroups (Q2947161) (← links)
- Nondeterministic Streaming String Transducers (Q3012906) (← links)
- Decomposing a $k$-valued transducer into $k$ unambiguous ones (Q3126010) (← links)
- Multi-sequential Word Relations (Q3451110) (← 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)
- Multi-Sequential Word Relations (Q4640041) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
- (Q5090448) (← links)
- (Q5092324) (← links)
- On the Containment and Equivalence Problems for GSMs, Transducers, and Linear CFGs (Q5200064) (← links)
- SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS (Q5247179) (← links)
- Lossiness of communication channels modeled by transducers1 (Q5283445) (← links)
- The Equivalence Problem of Finite Substitutions on <font>ab*c</font>, with Applications (Q5696933) (← links)
- FINITELY SUBSEQUENTIAL TRANSDUCERS (Q5696948) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)
- Transducing reversibly with finite state machines (Q5919580) (← links)
- On the difference set of two transductions (Q6614018) (← links)
