Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (Q1998865): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2020.10.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3093340218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Context-Free Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: CHARACTERIZATIONS OF BOUNDED SEMILINEAR LANGUAGES BY ONE-WAY AND TWO-WAY DETERMINISTIC MACHINES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ETOL systems of finite index / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the family of finite index matrix languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the effect of the finite index restriction on several families of grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear indexed languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite-index indexed grammars and their restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: MULTI-PUSH-DOWN LANGUAGES AND GRAMMARS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some decision problems concerning semilinearity and commutation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the generating sequences of regular languages on <i>k</i> symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: On counting functions and slenderness of languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5536271 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3854643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free grammar forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Turn Pushdown Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the commutative equivalence of bounded context-free and regular languages: the code case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the commutative equivalence of semi-linear sets of \(\mathbb{N}^k\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the commutative equivalence of bounded context-free and regular languages: the semi-linear case / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ambiguity in EOL systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4089754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effect of end-markers on counter machines and commutativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4140407 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On families of full trios containing counter machine languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reversal-bounded multipushdown machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on blind and partially blind one-way multicounter machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deux Familles de Langages Incomparables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3856117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4155837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The characterization of nonexpansive grammars by rational power series / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inherently ambiguous E0L languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inherent ambiguity of minimal linear grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytic models and ambiguity of context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking automata and one-way stack languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational sets in commutative monoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3644388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of the counting function of sparse context-free languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667954 / rank
 
Normal rank

Latest revision as of 18:22, 24 July 2024

scientific article
Language Label Description Also known as
English
Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity
scientific article

    Statements

    Relationships between bounded languages, counter machines, finite-index grammars, ambiguity, and commutative regularity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2021
    0 references
    0 references
    ET0L-systems
    0 references
    matrix grammars
    0 references
    rational series
    0 references
    commutative equivalence
    0 references
    counter machines
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references