BOOK-CHAPTER

Unambiguous Büchi Automata

Olivier CartonMax Michel

Year: 2000 Lecture notes in computer science Pages: 407-416   Publisher: Springer Science+Business Media
Keywords:
Automaton Computer science Mobile automaton Word (group theory) Path (computing) Büchi automaton Class (philosophy) Set (abstract data type) Timed automaton Discrete mathematics State (computer science) Theoretical computer science Finite-state machine Deterministic automaton Automata theory Algorithm Mathematics Artificial intelligence Programming language

Metrics

5
Cited By
0.00
FWCI (Field Weighted Citation Impact)
15
Refs
0.30
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

semigroups and automata theory
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Formal Methods in Verification
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Logic, programming, and type systems
Physical Sciences →  Computer Science →  Artificial Intelligence

Related Documents

JOURNAL ARTICLE

Unambiguous Büchi automata

Olivier CartonMax Michel

Journal:   Theoretical Computer Science Year: 2003 Vol: 297 (1-3)Pages: 37-81
JOURNAL ARTICLE

Singly exponential translation of alternating weak Büchi automata to unambiguous Büchi automata

Yong LiSven ScheweMoshe Y. Vardi

Journal:   Theoretical Computer Science Year: 2024 Vol: 1006 Pages: 114650-114650
JOURNAL ARTICLE

From LTL to unambiguous Büchi automata via disambiguation of alternating automata

Simon JantschDavid E. MullerChristel BaierJoachim Klein

Journal:   Formal Methods in System Design Year: 2021 Vol: 58 (1-2)Pages: 42-82
© 2026 ScienceGate Book Chapters — All rights reserved.