Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (Q3451103): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-variable logic on data words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on decision problems for three-way two-dimensional finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-memory automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4965866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstraction and pattern classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank

Latest revision as of 01:00, 11 July 2024

scientific article
Language Label Description Also known as
English
Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change
scientific article

    Statements

    Identifiers