Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Adrián, Patrik, Vaszil, György
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Tree-Verifiable Graph Grammars
par: Chimes, Mark, et autres
Publié: (2024)

Dynamic Programming for Symbolic Boolean Realizability and Synthesis
par: Lin, Yi, et autres
Publié: (2024)

Negated String Containment is Decidable (Technical Report)
par: Havlena, Vojtěch, et autres
Publié: (2025)

Improved Algorithm for Reachability in $d$-VASS
par: Fu, Yuxi, et autres
Publié: (2024)

From Sound Workflow Nets to LTLf Declarative Specifications by Casting Three Spells
par: Barbaro, Luca, et autres
Publié: (2025)

Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
par: Ye, Lina, et autres
Publié: (2023)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
par: Aceto, Luca, et autres
Publié: (2025)

LTL$_f$ Learning Meets Boolean Set Cover
par: Bathie, Gabriel, et autres
Publié: (2025)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
par: Rooduijn, Jan, et autres
Publié: (2024)

A proof theory of right-linear (omega-)grammars via cyclic proofs
par: Das, Anupam, et autres
Publié: (2024)

Function spaces for orbit-finite sets
par: Bojańczyk, Mikołaj, et autres
Publié: (2024)

An efficient quantifier elimination procedure for Presburger arithmetic
par: Haase, Christoph, et autres
Publié: (2024)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
par: Barloy, Corentin, et autres
Publié: (2025)

Positive First-order Logic on Words and Graphs
par: Kuperberg, Denis
Publié: (2022)

An algebraic theory of ω-regular languages, via μν-expressions
par: Das, Anupam, et autres
Publié: (2025)

Cyclic system for an algebraic theory of alternating parity automata
par: Das, Anupam, et autres
Publié: (2025)

A Hierarchy of Nondeterminism
par: Radi, Bader Abu, et autres
Publié: (2022)

A Dichotomy Theorem for Automatic Structures
par: Cuvelier, Antoine, et autres
Publié: (2026)

A Uniform Framework for Language Inclusion Problems
par: Doveri, Kyveli, et autres
Publié: (2024)

A Completeness Theorem for Probabilistic Regular Expressions
par: Różowski, Wojciech, et autres
Publié: (2023)

Recomposition: A New Technique for Efficient Compositional Verification
par: Dardik, Ian, et autres
Publié: (2024)

A Session Type System for Asynchronous Unreliable Broadcast Communication
par: Kouzapas, Dimitrios, et autres
Publié: (2019)

SENTIL: A Runtime Verification Tool for Probabilistic Temporal Logic
par: Quansah, Paapa Kwesi, et autres
Publié: (2026)

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
par: Guha, Shibashis, et autres
Publié: (2021)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
par: Nakamura, Yoshiki
Publié: (2026)

A Direct Translation from LTL with Past to Deterministic Rabin Automata
par: Azzopardi, Shaun, et autres
Publié: (2024)

A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata
par: Takata, Yoshiaki, et autres
Publié: (2024)

A Uniform Framework for Handling Position Constraints in String Solving (Technical Report)
par: Chen, Yu-Fang, et autres
Publié: (2025)

A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
par: Tsai, Wei-Lun, et autres
Publié: (2026)

A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata
par: Doveri, Kyveli, et autres
Publié: (2026)

Kofola 1.0: A Modular Approach to ω-Regular Complementation and Inclusion Checking (Technical Report)
par: Alexaj, Ondrej, et autres
Publié: (2026)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
par: Li, Junle, et autres
Publié: (2025)

Image Reflection on Process Graphs -- A Novel Approach for the Completeness of an Axiomatization of 1-Free Regular Expressions Modulo Bisimilarity
par: Zhang, Yuanrui, et autres
Publié: (2023)

Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report)
par: Abdulla, Parosh Aziz, et autres
Publié: (2024)

AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)
par: Chen, Yu-Fang, et autres
Publié: (2024)

Simple grammar bisimilarity, with an application to session type equivalence
par: Poças, Diogo, et autres
Publié: (2024)

On Dependent Variables in Reactive Synthesis
par: Akshay, S., et autres
Publié: (2024)

Attractors of Parikh mapping iterations
par: Chunikhin, Alexander
Publié: (2024)

Invariants for One-Counter Automata with Disequality Tests
par: Chistikov, Dmitry, et autres
Publié: (2024)

Proceedings Combined 31st International Workshop on Expressiveness in Concurrency and 21st Workshop on Structural Operational Semantics
par: Caltais, Georgiana, et autres
Publié: (2024)