scientific article

From MaRDI portal

Revision as of 13:56, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3336722

Jump to:navigation, search

zbMath0546.68063MaRDI QIDQ3336722

Juergen Dassow

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

formal language regulated rewriting complexity of languages number of nonterminals

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Parsimonious computational completeness ⋮ Language classes generated by tree controlled grammars with bounded nonterminal complexity ⋮ Nonterminal complexity of tree controlled grammars ⋮ Language Classes Generated by Tree Controlled Grammars with Bounded Nonterminal Complexity ⋮ Unnamed Item ⋮ Unnamed Item

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3336722&oldid=16581495"