scholarly journals Context-freeness of the languages of Schützenberger automata of HNN-extensions of finite inverse semigroups

2016 ◽  
Vol 99 (113) ◽  
pp. 177-191
Author(s):  
Mohammed Ayyash ◽  
Emanuele Rodaro
Keyword(s):  
Inverse Semigroup ◽  
Word Problem ◽  
Polynomial Time ◽  
Inverse Semigroups ◽  
Free Graph ◽  
Hnn Extensions ◽  
Language L ◽  
Hnn Extension ◽  
Context Free ◽  
Standard Presentation

We prove that the Sch?tzenberger graph of any element of the HNN-extension of a finite inverse semigroup S with respect to its standard presentation is a context-free graph in the sense of [11], showing that the language L recognized by this automaton is context-free. Finally we explicitly construct the grammar generating L, and from this fact we show that the word problem for an HNN-extension of a finite inverse semigroup S is decidable and lies in the complexity class of polynomial time problems.

HNN EXTENSIONS OF SEMILATTICES

1999 ◽  
Vol 09 (05) ◽  
pp. 555-596 ◽  
Author(s):  
AKIHIRO YAMAMURA
Keyword(s):  
Inverse Semigroup ◽  
Word Problem ◽  
Inverse Semigroups ◽  
The Third ◽  
Maximal Group ◽  
Hnn Extensions ◽  
Solvable Word Problem ◽  
Hnn Extension ◽  
Subgroup Theorem ◽  
Solvable Word

The main purpose of this paper is to investigate properties of an HNN extension of a semilattice, to give its equivalent characterizations and to discuss similarities with free groups. An HNN extension of a semilattice is shown to be a universal object in a certain category and an F-inverse cover over a free group for every inverse semigroup in the category. We also show that a graph with respect to a certain subset of an HNN extension of a semilattice is a tree and that this property characterizes an HNN extension of a semilattice. Moreover, we look into three subclasses: the class of full HNN extensions of semilattices with an identity, the class of universally E-unitary inverse semigroups and the class of HNN extensions of finite semilattices. The first class consists of factorizable E-unitary inverse semigroups whose maximal group homomorphic images are free. We obtain a generalization of the Nielsen–Schreier subgroup theorem to this class. The second consists of inverse semigroups presented by relations on Dyck words. An inverse semigroup in the third class has a relatively easy finite presentation using a Dyck language and has solvable word problem.

HNN extensions of inverse semigroups with zero

2007 ◽  
Vol 142 (1) ◽  
pp. 25-39 ◽  
Author(s):  
E. R. DOMBI ◽  
N. D. GILBERT
Keyword(s):  
Normal Form ◽  
Inverse Semigroup ◽  
Inverse Semigroups ◽  
Universal Group ◽  
Main Application ◽  
Hnn Extensions ◽  
Hnn Extension ◽  
Natural Way

AbstractWe study a construction of an HNN extension for inverse semigroups with zero. We prove a normal form for the elements of the universal group of an inverse semigroup that is categorical at zero, and use it to establish structural results for the universal group of an HNN extension. Our main application of the HNN construction is to show that graph inverse semigroups –including the polycyclic monoids –admit HNN decompositions in a natural way, and that this leads to concise presentations for them.

FINITE PRESENTABILITY OF HNN EXTENSIONS OF INVERSE SEMIGROUPS

2005 ◽  
Vol 15 (03) ◽  
pp. 423-436 ◽  
Author(s):  
E. R. DOMBI ◽  
N. D. GILBERT ◽  
N. RUŠKUC
Keyword(s):  
Inverse Semigroup ◽  
Inverse Semigroups ◽  
Finitely Generated ◽  
Semigroup Presentation ◽  
Hnn Extensions ◽  
Hnn Extension ◽  
Finite Presentability ◽  
Order Ideals ◽  
Inverse Subsemigroups ◽  
Finitely Presented

HNN extensions of inverse semigroups, where the associated inverse subsemigroups are order ideals of the base, are defined by means of a construction based upon the isomorphism between the categories of inverse semigroups and inductive groupoids. The resulting HNN extension may conveniently be described by an inverse semigroup presentation, and we determine when an HNN extension with finitely generated or finitely presented base is again finitely generated or finitely presented. Our main results depend upon properties of the [Formula: see text]-preorder in the associated subsemigroups. Let S be a finitely generated inverse semigroup and let U, V be inverse subsemigroups of S, isomorphic via φ: U → V, that are order ideals in S. We prove that the HNN extension S*U,φ is finitely generated if and only if U is finitely [Formula: see text]-dominated. If S is finitely presented, we give a necessary and suffcient condition for S*U,φ to be finitely presented. Here, in contrast to the theory of HNN extensions of groups, it is not necessary that U be finitely generated.

scholarly journals Locally full HNN extensions of inverse semigroups

2001 ◽  
Vol 70 (2) ◽  
pp. 235-272 ◽  
Author(s):  
Akihiro Yamamura
Keyword(s):  
Normal Form ◽  
Inverse Semigroup ◽  
Fundamental Group ◽  
Maximal Subgroup ◽  
Inverse Semigroups ◽  
Group Presentation ◽  
Graph Of Groups ◽  
Hnn Extensions ◽  
Hnn Extension ◽  
Normal Form Theorem

AbstractWe investigate a locally full HNN extension of an inverse semigroup. A normal form theorem is obtained and applied to the word problem. We construct a tree and show that a maximal subgroup of a locally full HNN extension acts on the tree without inversion. Bass-Serre theory is employed to obtain a group presentation of the maximal subgroup as a fundamental group of a certain graph of groups associated with the D-structure of the original semigroup.

Decidability of the word problem in Yamamura’s HNN extensions of finite inverse semigroups

2008 ◽  
Vol 77 (2) ◽  
pp. 163-186 ◽  
Author(s):  
Emanuele Rodaro ◽  
Alessandra Cherubini
Keyword(s):  
Word Problem ◽  
Inverse Semigroups ◽  
Hnn Extensions

Some completely semisimple HNN-extensions of inverse semigroups

2019 ◽  
Vol 30 (02) ◽  
pp. 217-243
Author(s):  
Mohammed Abu Ayyash ◽  
Alessandra Cherubini
Keyword(s):  
Inverse Semigroup ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Inverse Semigroups ◽  
Bicyclic Semigroup ◽  
Hnn Extensions ◽  
Necessary And Sufficient ◽  
Completely Semisimple

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 completely semisimple if and only if it does not contain a copy of the bicyclic semigroup, we first characterize such HNN-extensions containing a bicyclic subsemigroup making use of the special feature of their Schützenberger automata.

Amalgams vs Yamamura's HNN-Extensions of Inverse Semigroups

2011 ◽  
Vol 18 (04) ◽  
pp. 647-657 ◽  
Author(s):  
Alessandra Cherubini ◽  
Emanuele Rodaro
Keyword(s):  
Free Product ◽  
Inverse Semigroups ◽  
Hnn Extensions ◽  
Amalgamated Free Product ◽  
Hnn Extension

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-extensions. As a consequence, we show how to obtain the Schützenberger graph of a word w with respect to the presentation of an amalgamated free product starting from the Schützenberger graph of a suitable word w′ with respect to the presentation of the associated HNN-extension by simply making V-quotients and deletions of edges.

Free Objects in Certain Varieties of Inverse Semigroups

1990 ◽  
Vol 42 (6) ◽  
pp. 1084-1097 ◽  
Author(s):  
S. W. Margolis ◽  
J. C. Meakin ◽  
J. B. Stephen
Keyword(s):  
Inverse Semigroup ◽  
Word Problem ◽  
Inverse Semigroups ◽  
Covering Space ◽  
Brandt Semigroup ◽  
Graphical Methods ◽  
Free Objects ◽  
Variety Of Groups

AbstractIn this paper it is shown how the graphical methods developed by Stephen for analyzing inverse semigroup presentations may be used to study varieties of inverse semigroups. In particular, these methods may be used to solve the word problem for the free objects in the variety of inverse semigroups generated by the five-element combinatorial Brandt semigroup and in the variety of inverse semigroups determined by laws of the form xn = xn + 1. Covering space methods are used to study the free objects in a variety of the form ∨ where is a variety of inverse semigroups and is the variety of groups.

THE BENFORD-NEWCOMB DISTRIBUTION AND UNAMBIGUOUS CONTEXT-FREE LANGUAGES

2008 ◽  
Vol 19 (03) ◽  
pp. 717-727
Author(s):  
BALA RAVIKUMAR
Keyword(s):  
Positive Integer ◽  
Polynomial Time ◽  
Formal Language ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Point Of View ◽  
Language L ◽  
Combinatorial Technique ◽  
Pumping Lemma ◽  
Context Free

For a string w ∈ {0,1, 2,…, d-1}*, let vald(w) denote the integer whose base d representation is the string w and let MSDd(x) denote the most significant or the leading digit of a positive integer x when x is written as a base d integer. Hirvensalo and Karhumäki [9] studied the problem of computing the leading digit in the ternary representation of 2x ans showed that this problem has a polynomial time algorithm. In [16], some applications are presented for the problem of computing the leading digit of AB for given inputs A and B. In this paper, we study this problem from a formal language point of view. Formally, we consider the language Lb,d,j = {w|w ∈ {0,1, 2,…, d-1}*, 1 ≤ j ≤ 9, MSDb(dvalb(w))) = j} (and some related classes of languages) and address the question of whether this and some related languages are context-free. Standard pumping lemma proofs seem to be very difficult for these languages. We present a unified and simple combinatorial technique that shows that these languages are not unambiguous context-free languages. The Benford-Newcomb distribution plays a central role in our proofs.

Sign in / Sign up

Export Citation Format

Share Document