Pages that link to "Item:Q5544289"

The following pages link to The unsolvability of the Equivalence Problem for Λ-Free nondeterministic generalized machines (Q5544289):

Displaying 50 items.

• On the containment and equivalence problems for two-way transducers (Q418777) (← links)
• The unsolvability of some Petri net language problems (Q599503) (← links)
• Extended symbolic finite automata and transducers (Q746776) (← links)
• The decidability of equivalence for deterministic finite transducers (Q754658) (← links)
• The equivalence problem of multitape finite automata (Q804302) (← links)
• The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
• New techniques for proving the decidability of equivalence problem (Q913523) (← links)
• Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
• On the equivalence of some transductions involving letter to letter morphisms on regular languages (Q1058303) (← links)
• The equivalence of finite valued transducers (on HDT0L languages) is decidable (Q1090467) (← links)
• Balance of many-valued transductions and equivalence problems (Q1095671) (← links)
• Probabilistic automata (Q1151262) (← links)
• An automaton generating series of graphs (Q1160576) (← links)
• Finite state relational programs (Q1169287) (← links)
• Analyse und Synthese von asynchronen ND-Automaten (Q1241430) (← links)
• Single-valued a-transducers (Q1242878) (← links)
• Some decision problems concerning sequential transducers and checking automata (Q1256855) (← links)
• The undecidability of some equivalence problems concerning ngsm's and finite substitutions (Q1269922) (← links)
• On the lengths of values in a finite transducer (Q1323379) (← links)
• Decision problems of tree transducers with origin (Q1641005) (← links)
• Visibly pushdown transducers (Q1672009) (← links)
• A simple undecidable problem: Existential agreement of inverses of two morphisms on a regular language (Q1820585) (← links)
• Theory of formal grammars (Q1846334) (← links)
• Finite transducers and rational transductions (Q2074205) (← links)
• P systems with protein rules (Q2137149) (← links)
• One-way resynchronizability of word transducers (Q2233399) (← links)
• The unsolvability of the equality problem for sentential forms of context-free grammars (Q2264550) (← links)
• On the decidability of the valuedness problem for two-way finite transducers (Q2672252) (← links)
• A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
• Equivalence Checking Problem for Finite State Transducers over Semigroups (Q2947161) (← links)
• Nondeterministic Streaming String Transducers (Q3012906) (← links)
• Minimality and deadlockness of multitape automata (Q3184541) (← links)
• Solvability of equivalence problem for program machines (Q3341899) (← links)
• Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
• Multi-sequential Word Relations (Q3451110) (← links)
• On the Decidability of the Equivalence for k-Valued Transducers (Q3533016) (← links)
• (Q3736916) (← links)
• On some transducer equivalence problems for families of languages (Q3806848) (← links)
• Restricted one-counter machines with undecidable universe problems (Q3864502) (← links)
• A note on finite-valued and finitely ambiguous transducers (Q3968472) (← links)
• Transductions and the parallel generation of languages^† (Q3969888) (← links)
• New problems complete for nondeterministic log space (Q4109298) (← links)
• Cardinality problems of compositions of morphisms and inverse morphisms (Q4203829) (← links)
• Multi-Sequential Word Relations (Q4640041) (← links)
• Superlinear deterministic top-down tree transducers (Q4895817) (← links)
• Copyful Streaming String Transducers (Q4989167) (← links)
• Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines (Q5060068) (← links)
• (Q5089200) (← links)
• (Q5089228) (← links)
• Origin-equivalence of two-way word transducers is in PSPACE (Q5090958) (← links)