Learn With SAT to Minimize Büchi Automata

Electronic Proceedings in Theoretical Computer Science, EPTCS - United States
doi 10.4204/eptcs.96.6
Full Text
Abstract

Available in full text

Categories
Software
Date
Authors
Publisher

Open Publishing Association

Related search

Coinductive Algorithms for Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

On Complementing Nondeterministic Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Tighter Bounds for the Determinisation of Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Variations on Parallel Explicit Emptiness Checks for Generalized Büchi Automata

International Journal on Software Tools for Technology Transfer
Information SystemsSoftware
2016English

A Verified SAT Solver Framework With Learn, Forget, Restart, and Incrementality

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Efficient On-The-Fly Emptiness Check for Timed Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata

SIAM Journal on Computing
MathematicsComputer Science
2005English

From Parallel SAT to Distributed SAT

English

A SAT Approach to Branchwidth

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy