Tighter Bounds for the Determinisation of Büchi Automata

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-00596-1_13
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

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

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Learn With SAT to Minimize Büchi Automata

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2012English

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

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

Lower Bounds for Complementation of Omega-Automata via the Full Automata Technique

Logical Methods in Computer Science
Computer ScienceTheoretical Computer Science
2008English

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

SIAM Journal on Computing
MathematicsComputer Science
2005English

Lower Bounds for the Length of Reset Words in Eulerian Automata

International Journal of Foundations of Computer Science
Computer Science
2013English

Optimal Lower Bounds for Quantum Automata and Random Access Codes

English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy