scientific article; zbMATH DE number 7327955
From MaRDI portal
Publication:5856426
Pierre-Alain Reynier, Emmanuel Filiot, Léo Exibard
Publication date: 26 March 2021
Full work available at URL: https://arxiv.org/abs/1905.03538
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Reactive synthesis from visibly register pushdown automata ⋮ Temporal stream logic modulo theories ⋮ Church synthesis on register automata over linearly ordered data domains ⋮ Realizability problem for constraint LTL ⋮ On computability of data word functions defined by transducers
Cites Work
- Unnamed Item
- Unnamed Item
- Monadic second-order definable graph transductions: a survey
- Finite-memory automata
- On computability of data word functions defined by transducers
- Regular expressions for data words
- Regular Transformations of Data Words Through Origin Information
- Towards Efficient Parameterized Synthesis
- Synthesis with Identifiers
- LTL with the freeze quantifier and register automata
- Relating timed and register automata
- FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
- Graph Games and Reactive Synthesis
- Automata vs. Logics on Data Words
- Automata and Logics for Words and Trees over an Infinite Alphabet
- Alternation
- On equivalence and uniformisation problems for finite transducers
- Logics for Word Transductions with Synthesis
- Finite state machines for strings over infinite alphabets
- From Nondeterministic B\"uchi and Streett Automata to Deterministic Parity Automata
- Solving Sequential Conditions by Finite-State Strategies
- Two-Variable Logic with Two Order Relations
This page was built for publication:
