On the Complexity of Szilard Languages of Regulated Grammars (Q3105746): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Erkki Maekinen / rank
Normal rank
 
Property / author
 
Property / author: Erkki Maekinen / rank
 
Normal rank
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-23283-1_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2168928734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on leftmost restricted random context grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szilard languages of IO-grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pumping lemma for random permitting context languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counter machines and counter languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tape Comilexity of Some Classes of Szilard Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On context-free and Szilard languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Szilard's languages associated to a matrix grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: On derivation languages corresponding to context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4162500 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programmed Grammars and Classes of Formal Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniform circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix grammars with a leftmost restriction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5678435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shrinking lemma for random forbidding context languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:08, 4 July 2024

scientific article
Language Label Description Also known as
English
On the Complexity of Szilard Languages of Regulated Grammars
scientific article

    Statements

    On the Complexity of Szilard Languages of Regulated Grammars (English)
    0 references
    0 references
    0 references
    6 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    regulated rewriting grammars
    0 references
    Szilard languages
    0 references
    alternating Turing machines
    0 references
    \(\mathrm{NC}^1\)
    0 references
    \(\mathrm{NC}^2\) complexity classes
    0 references
    0 references