Pages that link to "Item:Q4178516"

The following pages link to A Purely Homomorphic Characterization of Recursively Enumerable Sets (Q4178516):

Displaying 32 items.

• Extended Watson-Crick L systems with regular trigger languages and restricted derivation modes (Q256437) (← links)
• The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
• Partial commutations and faithful rational transductions (Q799383) (← links)
• On binary equality sets and a solution to the test set conjecture in the binary case (Q1056551) (← links)
• A homomorphic characterization of recursively enumerable languages (Q1061494) (← links)
• On morphic generation of regular languages (Q1083217) (← links)
• Grammars, derivation modes and properties of indexed and type-0 languages (Q1098316) (← links)
• Representations of language families by homomorphic equality operations and generalized equality sets (Q1099633) (← links)
• A representation of recursively enumerable languages by two homomorphisms and a quotient (Q1115633) (← links)
• Test sets and checking words for homomorphism equivalence (Q1148122) (← links)
• Multiple equality sets and Post machines (Q1148696) (← links)
• A homomorphic characterization of regular languages (Q1162364) (← links)
• 2DST mappings of languages and related problems (Q1164438) (← links)
• The (generalized) Post correspondence problem with lists consisting of two words is decidable (Q1168746) (← links)
• A note on morphic characterization of languages (Q1171887) (← links)
• On characterizations of recursively enumerable languages (Q1262786) (← links)
• 2-testability and relabelings produce everything (Q1271607) (← links)
• Sticker systems (Q1275468) (← links)
• On simplest possible solutions for Post Correspondence Problems (Q1323352) (← links)
• Yield-languages of two-way pushdown tree automata (Q1352013) (← links)
• Finite transducers and rational transductions (Q2074205) (← links)
• Loops in automata and HDTOL relations (Q3479541) (← links)
• Large Simple Binary Equality Words (Q3533027) (← links)
• ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS (Q3646166) (← links)
• (Q3870326) (← links)
• A homomorphic characterization of time and space complexity classes of languages† (Q3888530) (← links)
• Post correspondence problem: Words possible as primitive solutions (Q4645167) (← links)
• LARGE SIMPLE BINARY EQUALITY WORDS (Q4923286) (← links)
• Reachability via Cooperating Morphisms (Q4982083) (← links)
• On the equivalence problem for deterministic multitape automata and transducers (Q5096179) (← links)
• ON THE DUAL POST CORRESPONDENCE PROBLEM (Q5247173) (← links)
• DISTRIBUTED PROCESSING IN AUTOMATA (Q5249019) (← links)