Results 121 to 130 of about 157,848 (165)
Some of the next articles are maybe not open access.
Syntactic monoids in the construction of systolic tree automata
International Journal of Computer & Information Sciences, 1985A regular language L can be accepted by a systolic tree automaton where the processors at each node of the underlying binary tree are capable of computing the product of two elements in the syntactic monoid of L. This construction gives rise to certain minimization problems which are studied in this paper.
Helmut Jürgensen, Arto Salomaa
openaire +3 more sources
Lee monoid $$L_4^1$$L41 is non-finitely based
Algebra Universalis, 2017We establish a new sufficient condition under which a monoid is non-finitely based and apply this condition to show that the 9-element monoid $$L_4^1$$L41 is non-finitely based.
I. Mikhailova, O. Sapir
semanticscholar +1 more source
International Conference on Formal Structures for Computation and Deduction
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of parametricity for a
C. B. Aberl'e +3 more
semanticscholar +1 more source
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of parametricity for a
C. B. Aberl'e +3 more
semanticscholar +1 more source
Semidirect Product Decompositions for Periodic Regular Languages
International Conference on Developments in Language TheoryThe definition of period in finite-state Markov chains can be extended to regular languages by considering the transitions of DFAs accepting them. For example, the language $(\Sigma\Sigma)^*$ has period two because the length of a recursion (cycle) in ...
Yusuke Inoue +2 more
semanticscholar +1 more source
Syntactic complexity of context-free grammars over word monoids
Acta Informatica, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
An algebraic framework for the study of the syntactic monoids application to the group languages [PDF]
, 1976 We study here a category whose objects are the pairs (M,P) where M is a monoid and P a subset of M. This gives a suitable algebraic framework for studying the relationships between the properties of a language and those of its syntactic monoid, specially in the case of the infinite syntactic monoids as we did in [12, 13, 14].
openaire +1 more source
Which monoids are syntactic monoids of \(\omega\)-languages?
The algebraic structure of the syntactic monoids of languages reflect many interesting properties of the languages themselves, and in the theory of regular languages the study of these monoids holds a central place since many years. More recently, this study has been extended to \(\omega\)-languages, that is to say, to languages consisting of infinite ...Jürgensen, Helmut, Thierrin, Gabriel
openaire +1 more source