Results 11 to 20 of about 35 (34)
Weighted omega-Restricted One Counter Automata [PDF]
Logical Methods in Computer Science, 2018 Let $S$ be a complete star-omega semiring and $\Sigma$ be an alphabet. For a weighted $\omega$-restricted one-counter automaton $\mathcal{C}$ with set of states $\{1, \dots, n\}$, $n \geq 1$, we show that there exists a mixed algebraic system over a ...
Manfred Droste, Werner Kuich
doaj +1 more source
Cartesian composition and the problem of generalizing the MAC condition to quasi-multiautomata
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2016 When we assume that the input-set of an automaton without output is a semihypergroup instead of a monoid, we talk about quasi-multiautomata. Even though cartesian composition of quasi-automata is a commonly used concept, the cartesian composition of ...
Chvalina Jan +2 more
doaj +1 more source
Monoids of ND-Full Hypersubstitutions
Discussiones Mathematicae - General Algebra and Applications, 2019 An nd-full hypersubstitution maps any operation symbols to the set of full terms of type τn. Nd-full hypersubstitutions can be extended to mappings which map sets of full terms to sets of full terms.
Lekkoksung Somsak
doaj +1 more source
CCS with Hennessy's merge has no finite equational axiomatization [PDF]
, 2004 This paper confirms a conjecture of Bergstra and Klop¿s from 1984 by establishing that the process algebra obtained by adding an auxiliary operator proposed by Hennessy in 1981 to the recursion free fragment of Milner¿s Calculus of Communicationg Systems
Fokkink, W.J. (Wan) +7 more
core
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers [PDF]
, 1999 This paper shows that the collection of identities in two variableswhich hold in the algebra N of the natural numbers with constantzero, and binary operations of sum and maximum does not have afinite equational axiomatization.
Ésik, Zoltán +2 more
core
Theoretical Informatics and Applications Will be set by the publisher ON CONJUGACY OF LANGUAGES ∗
, 2008 . We say that two languages X and Y are conjugates if they satisfy the conjugacy equation XZ = ZY for some language Z. We study several problems associated to this equation.
Ján Maňuch +2 more
core
The rank and Hanna Neumann property of some submonoids of a free monoid [PDF]
This work aims at further investigations on the work of Giambruno and Restivo [5] to find the rank of the intersection of two finitely generated submonoids of a free monoid.
Krishna, K. V., Singh, Shubh Narayan
core
Algebraic and Topological Theory of Languages
, 2007 : A language is torsion (resp. bounded torsion, aperiodic, bounded aperiodic) if its syntactic monoid is torsion (resp. bounded torsion, aperiodic, bounded aperiodic). We generalize the regular language theorems of Kleene, Schutzenberger and Straubing to
Pascal Weil, John Rhodes
core
, 1996 Fokkink and Zantema ((1994) Computer Journal 37:259-267) have shown thatbisimulation equivalence has a finite equational axiomatization over the languageof Basic Process Algebra with the binary Kleene star operation (BPA*).
Aceto, Luca +2 more
core
Some of the next articles are maybe not open access.
Related searches:
Related searches: