Associativity of Infinite Synchronized Shuffles and Team Automata (Articolo in rivista)

Type
Label
  • Associativity of Infinite Synchronized Shuffles and Team Automata (Articolo in rivista) (literal)
Anno
  • 2009-01-01T00:00:00+01:00 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#doi
  • 10.3233/FI-2009-0051 (literal)
Alternative label
  • Maurice H. ter Beek; Jetty Kleijn (2009)
    Associativity of Infinite Synchronized Shuffles and Team Automata
    in Fundamenta informaticae; IOS Press, Amsterdam (Paesi Bassi)
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Maurice H. ter Beek; Jetty Kleijn (literal)
Pagina inizio
  • 437 (literal)
Pagina fine
  • 461 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://iospress.metapress.com/content/14412t181p811636/ (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume
  • 91 (literal)
Rivista
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note
  • In: Fundamenta Informaticae, vol. 91 (3-4) pp. 437 - 461. IOS Press, 2009. (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroFascicolo
  • 3-4 (literal)
Note
  • Google Scholar (literal)
  • Scopu (literal)
  • ISI Web of Science (WOS) (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Istituto di Scienza e Tecnologie dell'Informazione \"A. Faedo\", CNR Via G. Moruzzi 1, 56124 Pisa, Italy; Leiden Institute of Advanced Computer Science, Universiteit Leiden P.O. Box 9512, 2300 RA Leiden, The Netherlands (literal)
Titolo
  • Associativity of Infinite Synchronized Shuffles and Team Automata (literal)
Abstract
  • Motivated by different ways to obtain team automata from synchronizing component automata, we consider various definitions of synchronized shuffles of words. A shuffle of two words is an interleaving of their symbol occurrences which preserves the original order of these occurrences within each of the two words. In a synchronized shuffle, however, also two occurrences of one symbol, each from a different word, may be identified as a single occurrence. In case at least one of the words involved is infinite, a (synchronized) shuffle can also be unfair in the sense that an infinite word may prevail from some point onwards even when the other word still has occurrences to contribute to the shuffle. We prove that for the synchronized shuffle operations under consideration, every (fair or unfair) synchronized shuffle can be obtained as a limit of synchronized shuffles of the finite prefixes of the words involved. In addition, it is shown that with the exception of one, all synchronized shuffle operations that we consider satisfy a natural notion of associativity, also in case of unfairness. Finally, using these results, some compositionality results for team automata are established. (literal)
Editore
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi
Editore di
Insieme di parole chiave di
data.CNR.it