Skip to main content
SpringerLink
Log in

Determinization of Transducers over Infinite Words: The General Case

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We consider transducers over infinite words with a Büchi or a Muller acceptance condition. We give characterizations of functions that can be realized by Büchi and Muller sequential transducers. We describe an algorithm to determinize transducers defining functions over infinite words.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institut Gaspard Monge, Université de Marne-la-Vallée, Champs-sur-Marne, F-77454 Marne-la-Vallée, cedex 2, France

    Marie-Pierre Béal

  2. 2LIAFA, Université Paris 7, 2 place Jussieu, F-7521 Paris cedex, France

    Olivier Carton

Authors
  1. Marie-Pierre Béal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olivier Carton
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Marie-Pierre Béal or Olivier Carton.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Béal, MP., Carton, O. Determinization of Transducers over Infinite Words: The General Case. Theory Comput Systems 37, 483–502 (2004). https://doi.org/10.1007/s00224-003-1014-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-003-1014-9

Keywords

Search

Navigation