Variable Tree Automata over Infinite Ranked Alphabets (Q3014945): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Two-variable logic on data words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-variable logic on data trees and XML reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The IO- and OI-hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree acceptors and some of their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Automata over Infinite Alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushdown tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-memory automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic automata and context-free sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite state machines for strings over infinite alphabets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synchronized tree automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-state unification automata and relational languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized finite automata theory with an application to a decision problem of second-order logic / rank
 
Normal rank

Latest revision as of 06:00, 4 July 2024

scientific article
Language Label Description Also known as
English
Variable Tree Automata over Infinite Ranked Alphabets
scientific article

    Statements

    Identifiers