On the density of languages accepted by Turing machines and other machine models

DOI10.25596/JALC-2018-189zbMATH Open1397.68116OpenAlexW2798616579MaRDI QIDQ5376337FDOQ5376337

Authors: Oscar H. Ibarra, Ian McQuillan 

Publication date: 17 September 2018

Full work available at URL: https://arxiv.org/abs/1903.03018

Recommendations

• On the density of context-free and counter languages
• On the density of context-free and counter languages
• Undecidable problems concerning densities of languages
• LATIN 2004: Theoretical Informatics
• Conditional densities of regular languages

zbMATH Keywords

densitystacksqueuesTuring machinespushdownsstory languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited In (5)

• On the density of context-free and counter languages
• On store languages of language acceptors
• On the density of context-free and counter languages
• On store languages and applications
• Title not available (Why is that?)

This page was built for publication: On the density of languages accepted by Turing machines and other machine models

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