scientific article; zbMATH DE number 3507952

From MaRDI portal

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

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

Publication:4088273

Jump to:navigation, search

zbMath0324.68026MaRDI QIDQ4088273

Jan van Leeuwen

Publication date: 1975

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)

Related Items (6)

Petri net algorithms in the theory of matrix grammars ⋮ Abstract grammars based on transductions ⋮ The membership question for ETOL-languages is polynomially complete ⋮ ETOL-grammars and N-grammars ⋮ On the complexity of formal grammars ⋮ A useful lemma for context-free programmed grammars

This page was built for publication:

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