Matches in SemOpenAlex for { <https://semopenalex.org/work/W2078669675> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W2078669675 endingPage "7" @default.
- W2078669675 startingPage "2" @default.
- W2078669675 abstract "In Hartmanis (1980) a simple proof is given of the fact (originally proved in Valiant (1976)) that the relative succinctness of representing deterministic context-free languages by deterministic vs. nondeterministic pushdown automata is not recursively bounded, in the following sense: there is no recursive function which, for deterministic context-free languages L, can bound the size of the minimal deterministic pushdown automaton accepting L as a function of the size of a nondeterministic pushdown automaton accepting L. It is then stated that ...even if we would know (or be given) which pushdown automata describe deterministic languages, we still could not effectively write down the corresponding deterministic pushdown automata because of their enormous size which grows nonrecursively in the size of the nondeterministic pushdown This does not, however, rule out a priori the possibility that a partial recursive bound might exist, as a function of the description of the nondeterministic pushdown automaton rather than of its size; indeed, the proof in Hartmanis (1980) uses the fact that the bounding function is total. It is the purpose of this note to make a case for using partial bounding functions in questions of relative succinctness. It will be shown that for the examples considered in Hartmanis (1980) (deterministic context-free languages, unambiguous languages, regular languages), the best possible partial bound as a function of the description of the unrestricted automata, while still nonrecursive, has lower recursiontheoretic complexity than the best possible bound as a functions of the size of the unrestricted automata. An example wi l l be given of a class of languages for which there exists a partial recursive bound on the size of the restricted automata, again as a function of the description of the unrestricted automata, while no (total) recursive bound exists as a function of the size of the unrestricted automata." @default.
- W2078669675 created "2016-06-24" @default.
- W2078669675 creator A5064780466 @default.
- W2078669675 date "1982-01-01" @default.
- W2078669675 modified "2023-10-16" @default.
- W2078669675 title "On the recursion-theoretic complexity of relative succinctness of representations of languages" @default.
- W2078669675 cites W1999147218 @default.
- W2078669675 cites W2050612755 @default.
- W2078669675 cites W2094856502 @default.
- W2078669675 cites W2117832390 @default.
- W2078669675 cites W2530006810 @default.
- W2078669675 doi "https://doi.org/10.1016/s0019-9958(82)80081-8" @default.
- W2078669675 hasPublicationYear "1982" @default.
- W2078669675 type Work @default.
- W2078669675 sameAs 2078669675 @default.
- W2078669675 citedByCount "4" @default.
- W2078669675 countsByYear W20786696752015 @default.
- W2078669675 countsByYear W20786696752016 @default.
- W2078669675 crossrefType "journal-article" @default.
- W2078669675 hasAuthorship W2078669675A5064780466 @default.
- W2078669675 hasConcept C118615104 @default.
- W2078669675 hasConcept C136119220 @default.
- W2078669675 hasConcept C168773036 @default.
- W2078669675 hasConcept C199360897 @default.
- W2078669675 hasConcept C202444582 @default.
- W2078669675 hasConcept C2776493592 @default.
- W2078669675 hasConcept C33923547 @default.
- W2078669675 hasConcept C41008148 @default.
- W2078669675 hasConcept C80444323 @default.
- W2078669675 hasConceptScore W2078669675C118615104 @default.
- W2078669675 hasConceptScore W2078669675C136119220 @default.
- W2078669675 hasConceptScore W2078669675C168773036 @default.
- W2078669675 hasConceptScore W2078669675C199360897 @default.
- W2078669675 hasConceptScore W2078669675C202444582 @default.
- W2078669675 hasConceptScore W2078669675C2776493592 @default.
- W2078669675 hasConceptScore W2078669675C33923547 @default.
- W2078669675 hasConceptScore W2078669675C41008148 @default.
- W2078669675 hasConceptScore W2078669675C80444323 @default.
- W2078669675 hasIssue "1" @default.
- W2078669675 hasLocation W20786696751 @default.
- W2078669675 hasOpenAccess W2078669675 @default.
- W2078669675 hasPrimaryLocation W20786696751 @default.
- W2078669675 hasRelatedWork W1533976297 @default.
- W2078669675 hasRelatedWork W1997520998 @default.
- W2078669675 hasRelatedWork W2078669675 @default.
- W2078669675 hasRelatedWork W2466470134 @default.
- W2078669675 hasRelatedWork W2914150940 @default.
- W2078669675 hasRelatedWork W2978815016 @default.
- W2078669675 hasRelatedWork W4241638796 @default.
- W2078669675 hasRelatedWork W4251483198 @default.
- W2078669675 hasRelatedWork W4302069768 @default.
- W2078669675 hasRelatedWork W1680875858 @default.
- W2078669675 hasVolume "52" @default.
- W2078669675 isParatext "false" @default.
- W2078669675 isRetracted "false" @default.
- W2078669675 magId "2078669675" @default.
- W2078669675 workType "article" @default.