scientific article; zbMATH DE number 3529421

From MaRDI portal

Revision as of 07:23, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

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

Publication:4105792

Jump to:navigation, search

zbMath0338.68040MaRDI QIDQ4105792

Jozef Gruska

Publication date: 1976

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (6)

Small Universal Devices ⋮ Data representation and computational complexity ⋮ A pushdown automaton or a context-free grammar - which is more economical? ⋮ Comparison of some descriptional complexities of 0L systems obtained by a unifying approach ⋮ Simulating finite automata with context-free grammars. ⋮ Complexity of normal form grammars

This page was built for publication:

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