Tree Automata over Infinite Alphabets (Q5452188): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1007/978-3-540-78127-1_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1569718229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal model for an expressive fragment of XSLT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Context-free languages over infinite alphabets / 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: Finite-memory automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472919 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typechecking for XML transformers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Query automata over finite trees / 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: Decidability of Second-Order Theories and Automata on Infinite Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2740525 / 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 18:57, 27 June 2024

scientific article; zbMATH DE number 5252788
Language Label Description Also known as
English
Tree Automata over Infinite Alphabets
scientific article; zbMATH DE number 5252788

    Statements

    Identifiers