Non-emptiness test for automata over words indexed by the reals and rationals
From MaRDI portal
Publication:6666789
DOI10.1007/978-3-031-71112-1_7MaRDI QIDQ6666789
Could not fetch data.
Publication date: 20 January 2025
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Temporal logics over linear time domains are in PSPACE
- The complexity of temporal logic over the reals
- Automata on linear orderings
- Logic and rational languages of words indexed by linear orderings
- The decision problem for linear temporal logic
- The monadic theory of order
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
- Beitrage zur Begründung der transfiniten Mengenlehre. Art. I.
- A KLEENE THEOREM FOR LANGUAGES OF WORDS INDEXED BY LINEAR ORDERINGS
- On the elementary theory of linear order
- Decidability of Second-Order Theories and Automata on Infinite Trees
- About infinite and linear point manifolds.
This page was built for publication: Non-emptiness test for automata over words indexed by the reals and rationals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6666789)
