Pages that link to "Item:Q1120286"
From MaRDI portal
The following pages link to On the valuedness of finite transducers (Q1120286):
Displaying 38 items.
- Algorithmic aspects of decomposition and equivalence of finite-valued transducers (Q259883) (← links)
- Single-valuedness of tree transducers is decidable in polynomial time (Q685348) (← links)
- Second-order finite automata: expressive power and simple proofs using automatic structures (Q832943) (← links)
- Almost periodicity, finite automata mappings, and related effectiveness issues (Q845086) (← links)
- On the degree of ambiguity of finite automata (Q1177168) (← links)
- Another representation of finite transducers over real numbers (Q1264587) (← 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)
- Almost periodic sequences. (Q1401389) (← links)
- Reasoning about strings in databases (Q1807679) (← links)
- Lexicographic decomposition of \(k\)-valued transducers (Q1959399) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- Finite-automaton transformations of strictly almost-periodic sequences (Q2460478) (← links)
- Automatic Kolmogorov complexity, normality, and finite-state dimension revisited (Q2656172) (← links)
- On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
- Observation and distinction: representing information in infinite games (Q2701064) (← links)
- The isomorphism problem on classes of automatic structures with transitive relations (Q2847190) (← links)
- Equivalence Checking Problem for Finite State Transducers over Semigroups (Q2947161) (← links)
- Nondeterministic Streaming String Transducers (Q3012906) (← links)
- Where Automatic Structures Benefit from Weighted Automata (Q3098042) (← 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)
- On the Decidability of Bounded Valuedness for Transducers (Q3599160) (← links)
- Automatic Structures of Bounded Degree Revisited (Q3644760) (← links)
- Equivalence of finite-valued tree transducers is decidable (Q4301635) (← links)
- Multi-Sequential Word Relations (Q4640041) (← links)
- (Q4728263) (← links)
- Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← 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)
- FINITELY SUBSEQUENTIAL TRANSDUCERS (Q5696948) (← links)
- On the Ambiguity and Finite-Valuedness Problems in Acceptors and Transducers (Q5744131) (← links)
- A Pattern Logic for Automata with Outputs (Q5859645) (← links)
- Using acceptors as transducers (Q5958726) (← links)
- On the difference set of two transductions (Q6614018) (← links)
