Skip to main navigation Skip to search Skip to main content

Some algebraic properties of machine poset of infinite words

Research output: Contribution to journal › Article › peer-review

5 Citations (Scopus)

Abstract

The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are mostly interested in algebraic properties of the underlying partially ordered set. Results considered with the existence of supremum, infimum, antichains, chains and density aspects are investigated.

Original languageEnglish
Pages (from-to)451-466
Number of pages16
JournalRAIRO - Theoretical Informatics and Applications
Volume42
Issue number3
DOIs
Publication statusPublished - 2008

Keywords

  • Algebraic properties
  • Infinite words
  • Mealy machine
  • Poset

Fingerprint

Dive into the research topics of 'Some algebraic properties of machine poset of infinite words'. Together they form a unique fingerprint.

Cite this