Imagen de Portada

Openness And Partial Adjacency In One Variable TPTL

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Krishna, Shankara Narayanan, Madnani, Khushraj, Nag, Agnipratim, Pandya, Paritosh
Formato:	Preprint
Publicado:	2024
Materias:	Logic in Computer Science Formal Languages and Automata Theory 03B44 F.4.1; F.4.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Stratifiable formulae are not context-free
por: Ryan-Smith, Calliope
Publicado: (2023)

Introducing Divergence for Infinite Probabilistic Models
por: Finkel, Alain, et al.
Publicado: (2023)

A Logic For Fresh Labelled Transition Systems
por: Bandukara, Mohamed H, et al.
Publicado: (2025)

Orbit-finite linear programming
por: Ghosh, Arka, et al.
Publicado: (2023)

Characterizing NC1 with Typed Monoids
por: Dawar, Anuj, et al.
Publicado: (2025)

A Nivat Theorem for Weighted Alternating Automata over Commutative Semirings
por: Grabolle, Gustav
Publicado: (2022)

MightyPPL: Verification of MITL with Past and Pnueli Modalities
por: Ho, Hsi-Ming, et al.
Publicado: (2025)

On Some Complexity Results for Even Linear Languages
por: Cojocaru, Liliana
Publicado: (2024)

Learning Deterministic One-Counter Automata in Polynomial Time
por: Mathew, Prince, et al.
Publicado: (2025)

The complexity of downward closures of indexed languages
por: Mandel, Richard, et al.
Publicado: (2026)

Learning Realtime One-Counter Automata
por: Bruyère, Véronique, et al.
Publicado: (2021)

On History-Deterministic One-Counter Nets
por: Prakash, Keya, et al.
Publicado: (2022)

Model-Checking PCTL Properties of Stateless Probabilistic Pushdown Systems
por: Lin, Deren, et al.
Publicado: (2014)

Inquisitive Team Semantics of LTL
por: Bozzelli, Laura, et al.
Publicado: (2025)

Decision Problems on Copying and Shuffling
por: Halava, Vesa, et al.
Publicado: (2023)

An efficient quantifier elimination procedure for Presburger arithmetic
por: Haase, Christoph, et al.
Publicado: (2024)

On the Equivalence Checking Problem for Deterministic Top-Down Tree Automata
por: Deng, Zhibo, et al.
Publicado: (2025)

Finitely Presentable Higher-Dimensional Automata and the Irrationality of Process Replication
por: Basold, Henning, et al.
Publicado: (2023)

Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems (extended version)
por: Geatti, Luca, et al.
Publicado: (2024)

How Concise are Chains of co-Büchi Automata?
por: Ehlers, Rüdiger
Publicado: (2025)

A Decision Procedure for Probabilistic Kleene Algebra with Angelic Nondeterminism
por: Ong, Shawn, et al.
Publicado: (2025)

Parsing Hypergraphs using Context-Free Positional Grammars
por: Costagliola, Gennaro, et al.
Publicado: (2026)

Various Types of Comet Languages and their Application in External Contextual Grammars
por: Ködding, Marvin, et al.
Publicado: (2024)

Algebraic Language Theory with Effects
por: Lenke, Fabian, et al.
Publicado: (2024)

Commuting upper triangular binary morphisms
por: Honkala, Juha
Publicado: (2023)

Active Learning Techniques for Pomset Recognizers
por: Pommellet, Adrien, et al.
Publicado: (2025)

Minimal History-Deterministic Co-Buchi Automata: Congruences and Passive Learning
por: Löding, Christof, et al.
Publicado: (2025)

A Robust Measure on FDFAs Following Duo-Normalized Acceptance
por: Fisman, Dana, et al.
Publicado: (2023)

Store Languages of Turing Machines and Counter Machines
por: Friesen, Noah, et al.
Publicado: (2025)

Active Learning of Upward-Closed Sets of Words
por: Aristote, Quentin
Publicado: (2025)

Deciding DFA-Primality is NP-Hard
por: Spenner, Daniel Alexander
Publicado: (2026)

Planning with Probabilistic Opacity and Transparency: A Computational Model of Opaque/Transparent Observations
por: Udupa, Sumukha, et al.
Publicado: (2024)

Verifying Unboundedness via Amalgamation
por: Anand, Ashwani, et al.
Publicado: (2024)

Omega-Regular Robustness
por: Fisman, Dana, et al.
Publicado: (2025)

Runtime Consultants
por: Fisman, Dana, et al.
Publicado: (2025)

Monads, Comonads, and Transducers
por: Stefański, Rafał
Publicado: (2024)

Automata with Timers
por: Bruyère, Véronique, et al.
Publicado: (2023)

How to Demonstrate Metalinearness and Regularity by Tree-Restricted General Grammars
por: Havel, Martin, et al.
Publicado: (2024)

A Myhill-Nerode style Characterization for Timed Automata With Integer Resets
por: Doveri, Kyveli, et al.
Publicado: (2024)

Normal Forms for Elements of ${}^*$-Continuous Kleene Algebras Representing the Context-Free Languages
por: Hopkins, Mark, et al.
Publicado: (2023)