Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages (Q3075534): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/978-3-642-18381-2_36 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1486955936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Visibly pushdown languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4738285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic trellis automatat† / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way bounded cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and computational complexity of systolic trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONJUNCTIVE GRAMMARS GENERATE NON-REGULAR UNARY LANGUAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive grammars over a unary alphabet: Undecidability and unbounded growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Game-Theoretic Characterization of Boolean Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parenthesis Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of linear conjunctive grammars and trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unambiguous Boolean grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parsing for Boolean Grammars: A Generalization of Valiant’s Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive grammars with restricted disjunction / rank
 
Normal rank
Property / cites work
 
Property / cites work: On real time one-way cellular array / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:16, 3 July 2024

scientific article
Language Label Description Also known as
English
Comparing Linear Conjunctive Languages to Subfamilies of the Context-Free Languages
scientific article

    Statements

    Identifiers