scientific article; zbMATH DE number 58295

MaRDI QIDQ4005181zbMATH OpenFDO

Authors Paavo Turakainen

Publication date 27 September 1992

zbMATH Keywords

recursively enumerable languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On characterizations of recursively enumerable languages
• scientific article; zbMATH DE number 1774219
• A homomorphic characterization of recursively enumerable languages
• Publication:4939577
• Homomorphic characterizations of recursively enumerable languages with very small language classes

Cited in

(11)

• A representation of recursively enumerable languages by two homomorphisms and a quotient
• On characterizations of recursively enumerable languages
• Characterizations of recursively enumerable languages by means of insertion grammars
• DNA computing based on splicing: Universality results
• Representing recursively enumerable languages by iterated deletion
• Finite transducers and rational transductions
• Injectivity of the quotient h g of two morphisms and ambiguity of linear grammars
• Einfache Beweise Für Die Eindeutige Zerlegbarkeit Von Ausdrücken Endlicher und Unendlicher Sprachen
• scientific article; zbMATH DE number 1346367 (Why is no real title available?)
• scientific article; zbMATH DE number 1400024 (Why is no real title available?)
• A fixed point characterization of cofinite languages

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4005181)