Coinductive Algorithms for Büchi Automata

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-030-24886-4_15

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer International Publishing

Related search

On Complementing Nondeterministic Büchi Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003German

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

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

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

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

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

SIAM Journal on Computing
MathematicsComputer Science
2005English

Finite Automata for Caching in Matrix Product Algorithms

Physical Review A
2008English

General Algorithms for Testing the Ambiguity of Finite Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Coinductive Interpreters for Process Calculi

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy