On computability of data word functions defined by transducers (Q2200823): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3023763951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5271416 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTL with the freeze quantifier and register automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Transformations of Data Words Through Origin Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis with Identifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5856426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path Logics for Querying Graphs: Combining Expressiveness and Efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equivalence and uniformisation problems for finite transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pattern logic for automata with outputs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two decidability problems for infinite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of Lookahead in Regular Infinite Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalence problems for mappings on infinite strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Sequential Conditions by Finite-State Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-memory automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded synthesis of register transducers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular expressions for data words / 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: Q4205072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on: ``How to decide continuity of rational functions on infinite words'' / rank
 
Normal rank

Latest revision as of 16:40, 23 July 2024

scientific article
Language Label Description Also known as
English
On computability of data word functions defined by transducers
scientific article

    Statements

    On computability of data word functions defined by transducers (English)
    0 references
    0 references
    0 references
    0 references
    23 September 2020
    0 references
    0 references
    data words
    0 references
    register automata
    0 references
    register transducers
    0 references
    functionality
    0 references
    continuity
    0 references
    computability
    0 references
    0 references