Efficient algorithms for morphisms over omega-regular languages

© Lukas Fleischer and Manfred Kufleitner;. Morphisms to finite semigroups can be used for recognizing omega-regular languages. The socalled strongly recognizing morphisms can be seen as a deterministic computation model which provides minimal objects (known as the syntactic morphism) and a trivial c...

Full description

Saved in:
Bibliographic Details
Main Authors: Lukas Fleischer, Manfred Kufleitner
Format: Default Conference proceeding
Published: 2015
Subjects:
Other information and computing sciences not elsewhere classified
Buchi automata
Omega-regular language
Syntactic semigroup
Recognizing morphism
MSO
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/31981
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items