The characterization of nonexpansive grammars by rational power series
From MaRDI portal
Publication:3939260
DOI10.1016/S0019-9958(81)90634-3zbMath0481.68075MaRDI QIDQ3939260
Publication date: 1981
Published in: Information and Control (Search for Journal in Brave)
context-free grammardependency graphsstrong nonexpansive componentsunion of unambiguous context-free languages
Related Items
Truncations of infinite matrices and algebraic series associated with some CF grammars ⋮ Analytic models and ambiguity of context-free languages ⋮ Information rate of some classes of non-regular languages: an automata-theoretic approach ⋮ Why We Need Semirings in Automata Theory (Extended Abstract) ⋮ On counting functions and slenderness of languages ⋮ On the Commutative Equivalence of Algebraic Formal Series and Languages ⋮ On bounded linear codes and the commutative equivalence ⋮ The complexity of computing the number of strings of given length in context-free languages ⋮ Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity ⋮ The Parikh Property for Weighted Context-Free Grammars