Programmed grammars and their relation to the LBA problem

DOI10.1007/S00236-006-0017-9zbMATH Open1102.68038OpenAlexW2013350288MaRDI QIDQ852006FDOQ852006

Markus Holzer, Henning Bordihn

Publication date: 27 November 2006

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-006-0017-9

Recommendations

• scientific article; zbMATH DE number 1738663
• Nonterminal complexity of programmed grammars.
• scientific article; zbMATH DE number 6606360
• The power of programmed grammars with graphs from various classes
• Programmed grammars with rule queues

zbMATH Keywords

Accepting grammarsDegree of non-regulationLBA problemLeftmost derivationsProgrammed grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classes of languages and linear-bounded automata
• Accepting grammars with regulation
• Title not available (Why is that?)
• Context sensitive table linden mayer languages and a relation to the LBA problem

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Programmed grammars and their relation to the LBA problem

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