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

International Journal on Software Tools for Technology Transfer - Germany
doi 10.1007/s10009-016-0422-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

On Complementing Nondeterministic Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Coinductive Algorithms for Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Tighter Bounds for the Determinisation of Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Learn With SAT to Minimize Büchi Automata

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2012English

Automata on Series-Parallel Biposets

BRICS Report Series
2001English

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

SIAM Journal on Computing
MathematicsComputer Science
2005English

Explicit Identities for the Generalized Tangent Polynomials

Nonlinear Analysis and Differential Equations
2018English

Generalized Automata and Stochastic Languages

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1969English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy