scientific article; zbMATH DE number 17554

zbMATH Open0802.68047MaRDI QIDQ3974879FDOQ3974879

Authors: Kai Salomaa 

Publication date: 26 June 1992

Title of this publication is not available (Why is that?)

Recommendations

• Yield-languages recognized by alternating tree recognizers
• scientific article; zbMATH DE number 4083011
• scientific article; zbMATH DE number 3967934
• Morphic characterizations of languages in Chomsky hierarchy with insertion and locality
• scientific article; zbMATH DE number 3945364

zbMATH Keywords

Turing computabilityrecursively enumerabletree automatonalternationtree structuresautomata on treesalternating yield languagesread-only finite-state automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Turing machines and related notions (03D10)

Cited In (4)

• A representation of recursively enumerable languages by two homomorphisms and a quotient
• Representing recursively enumerable languages by iterated deletion
• Synchronized tree automata
• Yield-languages recognized by alternating tree recognizers

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 Q3974879)