Loops and Overloops for Tree Walking Automata (Q5200062): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Translations on a context free grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-Walking Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-walking automata cannot be determinized / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-walking automata do not recognize all regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive closure logic, nested tree walking automata, and XPath / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Generation of Deterministic Tree (Walking) Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semantics of context-free languages: Correction / rank
 
Normal rank

Latest revision as of 09:10, 4 July 2024

scientific article; zbMATH DE number 5934389
Language Label Description Also known as
English
Loops and Overloops for Tree Walking Automata
scientific article; zbMATH DE number 5934389

    Statements