On weak growing context-sensitive grammars

DOI10.1007/3-540-59175-3_88zbMATH Open1495.68110OpenAlexW1550656372MaRDI QIDQ5096331FDOQ5096331

Gerhard Buntrock, Gundula Niemann

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_88

Mathematics Subject Classification ID

Formal languages and automata (68Q45) 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?)
• Title not available (Why is that?)
• On Computable Numbers, with an Application to the Entscheidungsproblem
• On certain formal properties of grammars
• Membership for growing context-sensitive grammars is polynomial
• On the Tape Complexity of Deterministic Context-Free Languages
• Classes of languages and linear-bounded automata
• Tree-size bounded alternation
• On the complexity of formal grammars
• Studies in abstract families of languages
• Normal forms for context-sensitive grammars
• On growing context-sensitive languages

Cited In (1)

• On the Mild Context-Sensitivity of k-Tree Wrapping Grammar

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Membership for growing context-sensitive grammars is polynomial 👍 👎
• Inferring Grammars for Mildly Context Sensitive Languages in Polynomial-Time 👍 👎
• Some results on contextual grammars^∗ 👍 👎
• Growing grammars and length-reducing automata 👍 👎
• The complexity of membership for deterministic growing context-sensitive grammars^∗ 👍 👎

This page was built for publication: On weak growing context-sensitive grammars

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