Complexity of EOL structural equivalence (Q5096917): 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: Derick Wood / rank
Normal rank
 
Property / author
 
Property / author: Sheng Yu / rank
Normal rank
 
Property / author
 
Property / author: Derick Wood / rank
 
Normal rank
Property / author
 
Property / author: Sheng Yu / 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/3-540-58338-6_105 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1545886122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975141 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of synchronization in parallel computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of some problems concerningL systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parenthesis Grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining families of trees with E0L grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4036764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural equivalence of context-free grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4746787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decidability of structural equivalence of E0L grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4284264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Equivalence of Finite Tree Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication for alternating machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The membership question for ETOL-languages is polynomially complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tape-complexity of context-independent developmental languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3031934 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:46, 29 July 2024

scientific article; zbMATH DE number 7573221
Language Label Description Also known as
English
Complexity of EOL structural equivalence
scientific article; zbMATH DE number 7573221

    Statements

    Identifiers