Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
On the recursion-theoretic complexity of relative succinctness of representations of languages - MaRDI portal

On the recursion-theoretic complexity of relative succinctness of representations of languages

From MaRDI portal

Publication:4750630

Jump to:navigation, search

DOI10.1016/S0019-9958(82)80081-8zbMath0512.03020MaRDI QIDQ4750630

Publication date: 1982

Published in: Information and Control (Search for Journal in Brave)

zbMATH Keywords

recursive function pushdown automata context free language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05)

Related Items (3)

On the sizes of DPDAs, PDAs, LBAs ⋮ The complexity of finding SUBSEQ\((A)\) ⋮ Program Size Complexity of Correction Grammars in the Ershov Hierarchy

This page was built for publication: On the recursion-theoretic complexity of relative succinctness of representations of languages

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