On the number of nonterminals in linear conjunctive grammars (Q596108): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 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.2004.03.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983278039 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On real-time cellular automata and trellis automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5526125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic trellis automatat† / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systolic trellis automata: Stability, decidability and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-way bounded cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonterminal complexity of programmed grammars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undecidability of the ambiguity problem for minimal linear grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Succinctness of Different Representations of Languages / 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: Sequential Machine Characterizations of Trellis and Cellular Automata and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4465339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive grammars and systems of language equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the closure properties of linear conjunctive languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recognition and parsing algorithm for arbitrary conjunctive grammars. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardest linear conjunctive language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5313800 / 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: Real-time language recognition by one-dimensional cellular automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On real time one-way cellular array / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214431 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:39, 6 June 2024

scientific article
Language Label Description Also known as
English
On the number of nonterminals in linear conjunctive grammars
scientific article

    Statements

    On the number of nonterminals in linear conjunctive grammars (English)
    0 references
    0 references
    10 August 2004
    0 references
    Formal languages
    0 references
    Conjunctive grammar
    0 references
    Trellis automaton
    0 references
    Cellular
    0 references
    automaton
    0 references
    Language equation
    0 references
    Descriptional complexity
    0 references
    Minimal linear grammar
    0 references

    Identifiers