Pages that link to "Item:Q3930659"
From MaRDI portal
The following pages link to Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages (Q3930659):
Displaying 38 items.
- Look-ahead on pushdowns (Q579952) (← links)
- The Ehrenfeucht conjecture: A compactness claim for finitely generated free monoids (Q798007) (← links)
- Partial commutations and faithful rational transductions (Q799383) (← links)
- On stateless multihead automata: hierarchies and the emptiness problem (Q844888) (← links)
- On binary equality sets and a solution to the test set conjecture in the binary case (Q1056551) (← links)
- An inverse homomorphic characterization of full principal AFL (Q1058861) (← links)
- A homomorphic characterization of recursively enumerable languages (Q1061494) (← links)
- On morphic generation of regular languages (Q1083217) (← links)
- On purely morphic characterizations of context-free languages (Q1098315) (← 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)
- Prefix and equality languages of rational functions are co-context-free (Q1124356) (← links)
- Multiple equality sets and Post machines (Q1148696) (← 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)
- Sticker systems (Q1275468) (← links)
- Refining the hierarchy of blind multicounter languages and twist-closed trios. (Q1427852) (← links)
- Fixed point languages of rational transductions (Q1822509) (← links)
- Topics in the theory of DNA computing. (Q1853473) (← links)
- Computational power of two stacks with restricted communication (Q1959441) (← links)
- Finite transducers and rational transductions (Q2074205) (← links)
- Unambiguous injective morphisms in free groups (Q2105430) (← links)
- On Boolean closed full trios and rational Kripke frames (Q2363961) (← links)
- Some wonders of a bio-computer-scientist (Q2678667) (← links)
- On characterisation of language families in terms of inverse morphisms (Q3343457) (← links)
- Ambiguity of Morphisms in a Free Group (Q3449361) (← links)
- ON THE POWER OF COOPERATING MORPHISMS VIA REACHABILITY PROBLEMS (Q3646166) (← links)
- Complete symmetry in d2l systems and cellular automata (Q3802630) (← links)
- On some transducer equivalence problems for families of languages (Q3806848) (← links)
- (Q3870326) (← links)
- On the generating power of regularly controlled bidirectional grammars (Q3979697) (← links)
- Characterizations of re languages starting from internal contextual languages<sup>∗</sup> (Q4380274) (← links)
- PARALLEL COMMUNICATING PUSHDOWN AUTOMATA SYSTEMS (Q4528767) (← links)
- Reachability via Cooperating Morphisms (Q4982083) (← links)
- ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS (Q5248992) (← links)
- On the difference set of two transductions (Q6614018) (← links)
- Decision problems on copying and shuffling (Q6614538) (← links)
