On the complementation of Büchi automata

DOI10.1016/0304-3975(86)90136-2zbMath0618.68068OpenAlexW2156298586MaRDI QIDQ1822512

Jean-Pierre Pecuchet

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90136-2

zbMATH Keywords

complementBüchi automaton\(\omega \)-language

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (4)

On the complementation of asynchronous cellular Büchi automata ⋮ Using automata theory for characterizing the semantics of terminological cycles ⋮ On the complementation of Büchi asynchronous cellular automata ⋮ Cellular automata, \(\omega{} \omega\)-regular sets, and sofic systems

Cites Work

• Automates boustrophédon et mots infinis
• Theories of automata on \(\omega\)-tapes: a simplified approach
• The monadic second order theory of all countable ordinals
• Testing and generating infinite sequences by a finite automaton
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complementation of Büchi automata