Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Alessandra Cherubini"'
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 19 no. 1, Iss Automata, Logic and Semantics (2017)
A finite deterministic (semi)automaton A = (Q, Σ, δ) is k-compressible if there is some word w ∈ Σ + such that theimage of its state set Q under the natural action of w is reduced by at least k states. Such word w, if it exists, is calleda k-com
Externí odkaz:
https://doaj.org/article/afb41477d6e347789f7008623380789e
Publikováno v:
Le Matematiche, Vol 51, Iss 3, Pp 63-80 (1996)
Semigroups, ideal extensions of a right (left)-zero semigroup by completely simple semigroup with zero adjoint, whose congruences are pairwise permutable are completely determined.
Externí odkaz:
https://doaj.org/article/dbd4a63c32554c0187dfe4581c8542eb
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 11 no. 1, Iss Automata, Logic and Semantics (2009)
Automata, Logic and Semantics
Externí odkaz:
https://doaj.org/article/6a4e479e992d47678f872e8cecd20c6f
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 9, Iss 2 (2007)
The Associative Language Description model (ALD) is a combination of locally testable and constituent structure ideas. It is consistent with current views on brain organization and can rather conveniently describe typical technical languages such as
Externí odkaz:
https://doaj.org/article/f6d4f683b0a1405abdd06e23b153da7c
Publikováno v:
International Journal of Algebra and Computation. 30:217-243
We give necessary and sufficient conditions in order that lower bounded HNN-extensions of inverse semigroups and HNN-extensions of finite inverse semigroups are completely semisimple semigroups. Since it is well known that an inverse semigroup is com
Autor:
Achille Frigeri, Alessandra Cherubini
Publikováno v:
Semigroup Forum. 98:571-588
The notion of semigroups with apartness has been introduced recently as a constructive counterpart of classical semigroups. On such structures, a constructive analogue of the isomorphism theorem has been proved, and quasiorder relations and related s
Publikováno v:
Theoretical Computer Science. 864:138
Publikováno v:
Theoretical Computer Science. 629:64-79
A finite deterministic automaton A = ( Q , Σ , ź ) is k-compressible if there is a word w ź Σ + such that the image of the state set Q under the natural action of w is reduced by at least k states. In such case w is called a k-compressing word fo
Publikováno v:
Semigroup Forum. 90:401-424
We use the description of the Schutzenberger automata for amalgams of finite inverse semigroups given by Cherubini, Meakin, Piochi to obtain structural results for such amalgams. Schutzenberger automata, in the case of amalgams of finite inverse semi
Autor:
Emanuele Rodaro, Alessandra Cherubini
Publikováno v:
Scopus-Elsevier
We investigate the connections between amalgams and Yamamura's HNN-extensions of inverse semigroups. In particular, we prove that amalgams of inverse semigroups with an identity adjoint are quotient semigroups of some special Yamamura's HNN-extension