Image de couverture de livre

Weighted Context-Free-Language Ordered Binary Decision Diagrams

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sistla, Meghana, Chaudhuri, Swarat, Reps, Thomas
Format:	Preprint
Publié:	2023
Sujets:	Formal Languages and Automata Theory Quantum Physics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams
par: Sistla, Meghana, et autres
Publié: (2022)

Do CFLOBDDs Actually Make Use of Linear Structure?
par: Sistla, Meghana Aparna, et autres
Publié: (2026)

Context-Free Languages of String Diagrams
par: Earnshaw, Matt, et autres
Publié: (2024)

Forbidden-Context & Ordered Grammar Systems
par: Fernau, Henning, et autres
Publié: (2026)

Compiling Quantum Regular Language States
par: Bellante, Armando, et autres
Publié: (2026)

A Tree Sampler for Bounded Context-Free Languages
par: Considine, Breandan
Publié: (2024)

Shuffles of Context-Free Languages along Regular Trajectories
par: Barloy, Corentin, et autres
Publié: (2026)

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
par: Kuriyama, Takayuki
Publié: (2014)

Regular Expressions with Backreferences on Multiple Context-Free Languages, and the Closed-Star Condition
par: Nogami, Taisei, et autres
Publié: (2024)

A Representative Framework for Implementing Quantum Finite Automata on Real Devices
par: Khadieva, Aliya, et autres
Publié: (2024)

Implementing a Quantum Finite Automaton in IBMQ using Custom Control Pulses
par: Lussi, Eduardo Willwock, et autres
Publié: (2024)

Regular language quantum states
par: Florido-Llinàs, Marta, et autres
Publié: (2024)

Formal verification of higher dimensional quantum protocols
par: Puthoor, Ittoop Vergheese
Publié: (2024)

On the Origin of Quantum Uncertainty
par: Adami, Christoph
Publié: (2020)

On the Simulation Cost of Quantum Finite Automata
par: Chen, Zeyu, et autres
Publié: (2026)

Learning Quantitative Automata Modulo Theories
par: Hsiung, Eric, et autres
Publié: (2024)

Directed Regular and Context-Free Languages
par: Ganardi, Moses, et autres
Publié: (2024)

Measure-Theoretic Aspects of Star-Free and Group Languages
par: Sin'ya, Ryoma, et autres
Publié: (2025)

Binary codes that do not preserve primitivity
par: Holub, Štěpán, et autres
Publié: (2022)

Localising Stochasticity in Weighted Automata
par: Agarwal, Smayan, et autres
Publié: (2026)

A relativistic discrete spacetime formulation of 3+1 QED
par: Eon, Nathanaël, et autres
Publié: (2022)

Weighted Automata and Regular Expressions for Financial Systems
par: Droste, Manfred, et autres
Publié: (2026)

Productive Quantum Programming Needs Better Abstract Machines
par: Núñez-Corrales, Santiago, et autres
Publié: (2025)

Closure and Decision Properties for Higher-Dimensional Automata
par: Amrane, Amazigh, et autres
Publié: (2023)

Weighted Tree Automata -- May it be a little more?
par: Fülöp, Zoltán, et autres
Publié: (2022)

Optimal Approximate Minimization of One-Letter Weighted Finite Automata
par: Lacroce, Clara, et autres
Publié: (2023)

Learning Weighted Automata over Number Rings, Concretely and Categorically
par: Aristote, Quentin, et autres
Publié: (2025)

A Complexity Bound for Determinisation of Min-Plus Weighted Automata
par: Almagor, Shaull, et autres
Publié: (2026)

Quantitative Language Automata
par: Henzinger, Thomas A., et autres
Publié: (2025)

Reversible Weighted Automata over Finite Rings and Monoids with Commuting Idempotents
par: Kostolányi, Peter, et autres
Publié: (2026)

Uniform Membership for Hyperedge Replacement Grammars and Related Decision Problems
par: Pshenitsyn, Tikhon
Publié: (2025)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
par: Yamakami, Tomoyuki
Publié: (2021)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
par: Mengel, Stefan, et autres
Publié: (2024)

Chance and Mass Interpretations of Probabilities in Markov Decision Processes (Extended Version)
par: Tsai, Yun Chen, et autres
Publié: (2025)

Pumping-Like Results for Copyless Cost Register Automata and Polynomially Ambiguous Weighted Automata
par: Mazowiecki, Filip, et autres
Publié: (2025)

Passive Model Learning of Visibly Deterministic Context-free Grammars
par: Muškardin, Edi, et autres
Publié: (2025)

Well-Formed Free-Choice Petri Nets Revisited
par: Jancar, Petr, et autres
Publié: (2026)

Static Analysis Framework for Detecting Use-After-Free Bugs in C++
par: Teodorescu, Vlad-Alexandru, et autres
Publié: (2024)

Random Graph Generation in Context-Free Graph Languages
par: Vastarini, Federico, et autres
Publié: (2024)

Universally Wheeler Languages
par: Becker, Ruben, et autres
Publié: (2025)