Post’s Correspondence Problem: From Computer Science to Algebra
Gespeichert in:
| Veröffentlicht in: | RP (16. : 2022 : Kaiserslautern) Reachability problems |
|---|---|
| 1. Verfasser: | |
| Format: | UnknownFormat |
| Sprache: | eng |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Tag hinzufügen | Titel | Jahr | Verfasser |
|---|---|---|
| Unambiguity and Fewness for Nonuniform Families of Polynomial-Size Nondeterministic Finite Automata | 2022 | Yamakami, Tomoyukt |
| Subsequences in Bounded Ranges: Matching and Analysis Problems | 2022 | Kosche, Maria |
| The Past and Future of Embedded Finite Model Theory | 2022 | Benedikt, Michael |
| SAT-Based Invarıant Inference and Its Relation to Concept Learning | 2022 | Feldman, Yotam M. Y. |
| The Stochastic Arrival Problem | 2022 | Webster, Thomas |
| Coefficient Synthesis for Threshold Automata | 2022 | Balasubramanian, A. R. |
| Post’s Correspondence Problem: From Computer Science to Algebra | 2022 | Ciobanu, Laura |
| Linearization, Model Reduction and Reachability in Nonlinear ODEs | 2022 | Boreale, Michele |
| History-Deterministic Timed Automata Are Not Determinizable | 2022 | Bose, Sougata |
| On Higher-Order Reachability Games Vs May Reachability | 2022 | Asada, Kazuyuki |
| Canonization of Reconfigurable PT Nets in Maude | 2022 | Capra, Lorenzo |