On the Expressiveness of Büchi Arithmetic

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:FOSSACS (24. : 2021 : Online) Foundations of software science and computation structures
1. Verfasser: Haase, Christoph (VerfasserIn)
Weitere Verfasser: Rozycki, Jakub (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2021
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Constructing a Universe for the Setoid Model 2021 Altenkirch, Thorsten
Fair Refinement for Asynchronous Session Types 2021 Bravetti, Mario
Leafy Automata for Higher-order Concurrency 2021 Dixon, Alex
Generalized Bounded Linear Logic and its Categorical Semantics 2021 Fukihara, Yöji
The Spirit of Node Replication 2021 Kesner, Delia
Certifying Inexpressibility 2021 Kupferman, Orna
A String Diagrammatic Axiomatisation of Finite-State Automata 2021 Piedeleu, Robin
Work-sensitive Dynamic Complexity of Formal Languages 2021 Schmidt, Jonas
A Quantified Coalgebraic van Benthem Theorem 2021 Wild, Paul
Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy 2021 Balasubramanian, A. R.
Fixpoint Theory - Upside Down 2021 Baldan, Paolo
Combining Semilattices and Semimodules 2021 Bonchi, Filippo
One-way Resynchronizability of Word Transducers 2021 Bose, Sougata
Factorization in Call-by-Name and Call-by-Value Calculi via Linear Logie 2021 Faggian, Claudia
Running Time Analysis of Broadcast Consensus Protocols 2021 Czerner, Philipp
Adjoint Reactive GUI Programming 2021 Graulund, Christian Uldal
Nondeterministic and co-Nondeterministic Implies Deterministic, for Data Languages 2021 Klin, Bartek
Learning Pomset Automata 2021 Heerdt, Gerco van
Nominal Equational Problems 2021 Ayala-Rincon, Mauricio
Interpolation and Amalgamation for Arrays with MaxDiff 2021 Ghilardi, Silvio
Alle Artikel auflisten