Copertina

A GLR-like Parsing Algorithm for Three-Valued Interpretations of Boolean Grammars with Strong Negation

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Adrián, Patrik, Vaszil, György
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Formal Languages and Automata Theory Logic in Computer Science
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Tree-Verifiable Graph Grammars
di: Chimes, Mark, et al.
Pubblicazione: (2024)

Dynamic Programming for Symbolic Boolean Realizability and Synthesis
di: Lin, Yi, et al.
Pubblicazione: (2024)

Negated String Containment is Decidable (Technical Report)
di: Havlena, Vojtěch, et al.
Pubblicazione: (2025)

Improved Algorithm for Reachability in $d$-VASS
di: Fu, Yuxi, et al.
Pubblicazione: (2024)

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells
di: Barbaro, Luca, et al.
Pubblicazione: (2025)

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
di: Ye, Lina, et al.
Pubblicazione: (2023)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
di: Aceto, Luca, et al.
Pubblicazione: (2025)

LTL$_f$ Learning Meets Boolean Set Cover
di: Bathie, Gabriel, et al.
Pubblicazione: (2025)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
di: Rooduijn, Jan, et al.
Pubblicazione: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
di: Das, Anupam, et al.
Pubblicazione: (2024)

Function spaces for orbit-finite sets
di: Bojańczyk, Mikołaj, et al.
Pubblicazione: (2024)

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

The Alternation Hierarchy of First-Order Logic on Words is Decidable
di: Barloy, Corentin, et al.
Pubblicazione: (2025)

Positive First-order Logic on Words and Graphs
di: Kuperberg, Denis
Pubblicazione: (2022)

An algebraic theory of ω-regular languages, via μν-expressions
di: Das, Anupam, et al.
Pubblicazione: (2025)

Cyclic system for an algebraic theory of alternating parity automata
di: Das, Anupam, et al.
Pubblicazione: (2025)

A Hierarchy of Nondeterminism
di: Radi, Bader Abu, et al.
Pubblicazione: (2022)

A Dichotomy Theorem for Automatic Structures
di: Cuvelier, Antoine, et al.
Pubblicazione: (2026)

A Uniform Framework for Language Inclusion Problems
di: Doveri, Kyveli, et al.
Pubblicazione: (2024)

A Completeness Theorem for Probabilistic Regular Expressions
di: Różowski, Wojciech, et al.
Pubblicazione: (2023)

Recomposition: A New Technique for Efficient Compositional Verification
di: Dardik, Ian, et al.
Pubblicazione: (2024)

A Session Type System for Asynchronous Unreliable Broadcast Communication
di: Kouzapas, Dimitrios, et al.
Pubblicazione: (2019)

SENTIL: A Runtime Verification Tool for Probabilistic Temporal Logic
di: Quansah, Paapa Kwesi, et al.
Pubblicazione: (2026)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
di: Guha, Shibashis, et al.
Pubblicazione: (2021)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
di: Nakamura, Yoshiki
Pubblicazione: (2026)

A Direct Translation from LTL with Past to Deterministic Rabin Automata
di: Azzopardi, Shaun, et al.
Pubblicazione: (2024)

A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata
di: Takata, Yoshiaki, et al.
Pubblicazione: (2024)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
di: Chen, Yu-Fang, et al.
Pubblicazione: (2025)

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
di: Tsai, Wei-Lun, et al.
Pubblicazione: (2026)

A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata
di: Doveri, Kyveli, et al.
Pubblicazione: (2026)

Kofola 1.0: A Modular Approach to ω-Regular Complementation and Inclusion Checking (Technical Report)
di: Alexaj, Ondrej, et al.
Pubblicazione: (2026)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
di: Li, Junle, et al.
Pubblicazione: (2025)

Image Reflection on Process Graphs -- A Novel Approach for the Completeness of an Axiomatization of 1-Free Regular Expressions Modulo Bisimilarity
di: Zhang, Yuanrui, et al.
Pubblicazione: (2023)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
di: Abdulla, Parosh Aziz, et al.
Pubblicazione: (2024)

AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
di: Chen, Yu-Fang, et al.
Pubblicazione: (2024)

Simple grammar bisimilarity, with an application to session type equivalence
di: Poças, Diogo, et al.
Pubblicazione: (2024)

On Dependent Variables in Reactive Synthesis
di: Akshay, S., et al.
Pubblicazione: (2024)

Attractors of Parikh mapping iterations
di: Chunikhin, Alexander
Pubblicazione: (2024)

Invariants for One-Counter Automata with Disequality Tests
di: Chistikov, Dmitry, et al.
Pubblicazione: (2024)

Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics
di: Caltais, Georgiana, et al.
Pubblicazione: (2024)