Deterministic context free languages

From MaRDI portal
Revision as of 03:19, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5521476

DOI10.1016/S0019-9958(66)80019-0zbMath0145.00802MaRDI QIDQ5521476

Sheila A. Greibach, Seymour Ginsburg

Publication date: 1966

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




Related Items (92)

The effect of end-markers on counter machines and commutativityThe Hoare Logic of Deterministic and Nondeterministic Monadic Recursion SchemesThe theory of languagesA pumping lemma for real-time deterministic context-free languagesOne-counter pushdown-storage automata as transducers of sequencesA universal compiler system based on production rulesAn approach to deciding the observational equivalence of Algol-like languagesAn analysis of the nonemptiness problem for classes of reversal-bounded multicounter machinesInput-driven languages are linear conjunctiveThe theory of languagesSyntax checking either wayChurch-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languagesThe equivalence problem for deterministic pushdown automata is decidableUnnamed ItemDeletion operations on deterministic families of automataUnnamed ItemAspects of Reversibility for Classical AutomataSuperdeterministic DPDAs: The method of accepting does affect decision problemsOutfix-guided insertionConjunctive and Boolean grammars: the true general case of the context-free grammarsOne-way weak-stack-counter automataGeneralized overlap resolvable grammars and their parsersOn the complexity of decision problems for some classes of machines and applicationsLattice walks ending on a coordinate hyperplane avoiding backtracking and repeatsAchievable high scores of \(\varepsilon\)-moves and running times in DPDA computationsA Note on Pushdown Store Automata and Regular SystemsInsertion operations on deterministic reversal-bounded counter machinesA hierarchy of deterministic context-free \(\omega\)-languages.Formal grammars for turn-bounded deterministic context-free languagesInput-Position-Restricted Models of Language AcceptorsNondeterministic auxiliary depth-bounded storage automata and semi-unbounded fan-in cascading circuits (extended abstract)The Hardest LL(k) LanguageStochastic grammars and languagesOn the complexity of regular-grammars with integer attributes\(\mathrm{GF}(2)\)-operations on basic families of formal languagesOn the Density of Context-Free and Counter LanguagesBetween SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automataThe equivalence problem for two dpda's, one of which is a finite-turn or one-counter machineOn LLP(k) grammars and languagesQuasi-rocking real-time pushdown automataThe Boolean closure of linear context-free languagesTHE PHENOMENON OF NON-RECURSIVE TRADE-OFFSThe inclusion problem for some subclasses of context-free languagesNecessary and sufficient conditions for a power language to be deterministicAccepting runs in a two-way finite automatonReversible pushdown automataOn the degrees of non-regularity and non-context-freenessAn improved bound for detecting looping configurations in deterministic PDA'sInvestigations on Automata and Languages Over a Unary AlphabetUnions of certain bounded deterministic languagesDecidability of DPDA equivalenceTransductions des langages de ChomskySimple context-free languages and free monadic recursion schemesOn jump-deterministic pushdown automataSyntax checking either wayComparing language operationsFinite automata with multiplicationTemporal logics with language parametersNormal forms of deterministic grammarsEquivalence problems for deterministic context-free languages and monadic recursion schemesA strong pumping lemma for context-free languagesA decidability result for deterministic \(\omega\)-context-free languagesOn LR(k) grammars and languagesOn store languages of language acceptorsOn inverse deterministic pushdown transductionsNondeterminism and Boolean operations in pda's\(\omega\)-computations on deterministic pushdown machinesState Complexity of the Quotient Operation on Input-Driven Pushdown AutomataOn equivalence and subclass containment problems for deterministic context-free languagesA note on non-singular deterministic pushdown automataRefining nondeterminism in context-free languagesA note on cyclic closure operationsOn equivalence of grammars through transformation treesThe complexity of the membership problem for some extensions of context-free languagest†Deterministic stack automata and the quotient operatorOutfix-Guided InsertionProperties of syntax directed translationsIntersections de langages algébriques bornesDecidability of the equivalence problem for deterministic pushdown automataUne généralisation des ensembles de DyckError detection in formal languagesOn the relation between the class of all context-free languages and the class of deterministic context-free languagesLR-regular grammars - an extension of LR(k) grammarsHOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGESStrict deterministic grammarsSur une propriété d'itération des langages algébriques déterministesInfinite regular Thue systemsInvito alla teoria dei linguaggi formali\(L(A)=L(B)\)? decidability results from complete formal systemsA note on chains of deterministic pushdown transducersA note on undecidable properties of formal languagesHierarchies of primitive recursive wordsequence functions: Comparisons and decision problems







This page was built for publication: Deterministic context free languages