The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Filters
Page 4868 of Mathematical Reviews Vol. , Issue 2004f
[page]
2004
Mathematical Reviews
Preserved Fulltext
We introduce the notion of two types of finite codes (o-codes and e-codes) over free binoids and show that for any given finite subset Y of L*(o,e) and x © {o,e}, one can decide effectively whether Y is ...
2004f:68077
2004f:68077 68Q45 68Q70
Hashiguchi, Kosaburo (J-OKAYEN-IT; Okayama) ;
Kunai, Takahiro (J-OKAYEN-IT; Okayama) ;
Jimbo, Shuji (J-OKAYEN-IT; Okayama)
Finite codes over free binoids. ...
Monoids with absorbing elements and their associated algebras
[article]
2016
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In general, a binoid M is finitely generated as {0, ∞} -binoid if and only if it is finitely generated over every binoid N that admits a binoid homomorphism ϕ : N → M . ...
, 35
cancellative -, 22
difference -, 74
dimension of a -, 121
dual of a -, 29
F -vector of a -, 122
finite -, 16
finitely generated -, 16
free -, 17
free commutative -, 17
free of asymptotic ...
Let (M i ) i∈I be a finite family of commutative N -binoids. Then Proof. Using an inductive argument, it suffices to prove the statement for I = {1, 2}. ...
arXiv:1603.02093v1
fatcat:c6uqoubiz5ahdlgu2ojasiv7jy
Shuffle binoids
1998
RAIRO - Theoretical Informatics and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
now the variables a, 6, c range over F and u, v, w range over ƒ. ...
We show that a certain class of labeled posets is free in the equational class of all shuffle binoids, and use this fact to then show that these posets embed in the shuffle binoid of languages. ...
doi:10.1051/ita/1998324-601751
fatcat:bb73u53envb5nmggtxb2wjdf6y
Page 1081 of Mathematical Reviews Vol. 52, Issue 3
[page]
1976
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Binoids include such mathematical structures as finite fields and groups with operators. ...
Consider a rate 1/v convolutional code with generator matrix (g:2::-8y), where g, are polynomials over GF(q). ...
Cumulative defect
2003
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We prove that if X is a ÿnite code and s is an inÿnite word with 3 X -factorizations, then the rank r(X ) of X is at most |X | − 2. ...
More generally, if X belongs to a certain family of codes and s has l ¿ 2 X -factorizations, then the rank is at most |X | − l + 1. .be (V. ...
-free hull of X ⊆ A + is the smallest free ÿnitary binoid of A ∞ which contains X . In particular the minimal generating set Y of the !-free hull is an !-code. ...
doi:10.1016/s0304-3975(01)00217-1
fatcat:qzm5j72uxfgoziel2o6rlqqaui
Multi-Stage Programs are Generalized Arrows
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
Object language providers need only implement the functions of the generalized arrow type class in point-free style. ...
Object language users may write metaprograms over these object languages in a point-ful style, using the same binding, scoping, abstraction, and application mechanisms in both the object language and metalanguage ...
The same applies to binoidality and premonoidality. ...
arXiv:1003.5954v3
fatcat:fltq67dbdraknfrdwwwflemcx4
Direct Models of the Computational Lambda-calculus
1999
Electronical Notes in Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2003; you can also visit the original URL.
The file type is application/pdf.
We can think of the thunkable morphisms as effect free. ...
Such closure properties may help direct-style code optimisation. ...
doi:10.1016/s1571-0661(04)80078-1
fatcat:45oltcmjkjbsrlzg77hndxgzy4
On Sets of Words of Rank Two
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2018 pre-print arXiv:1810.02182v1 fatcat:qdg25mgta5dbxjtklhmusvwoci
Given a (finite or infinite) subset X of the free monoid A^* over a finite alphabet A, the rank of X is the minimal cardinality of a set F such that X ⊆ F^*. ...
A + = A * \ {ε}) we denote the free monoid (resp. free semigroup) generated by A, i.e., the set of all finite words (resp. all finite nonempty words) over A. ...
Every subset X of the free monoid A * over a finite alphabet A generates a submonoid X * under the operation of concatenation of words. ...
arXiv:1810.02182v2
fatcat:d25wnsnzmbalfhzgxegylvl62y
Verified Decision Procedures on Context-Free Grammars
[chapter]
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
From its formalization, we generate executable code for a balancedness checking procedure and incorporate it into an existing program analyzer. genv-onestep ...
We verify three decision procedures on context-free grammars utilized in a program analyzer for a server-side programming language. ...
It is because the relations over states or nonterminals used there will become too large if int are used in the ML side. ...
doi:10.1007/978-3-540-74591-4_14
fatcat:fuozf3w5b5awvgbc6rcpm3xvk4
Page 2297 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(English summary) (see 2004k:68007 )
Hashiguchi, Kosaburo (with Kunai, Takahiro; Jimbo, Shuji) Finite codes over free binoids. ...
(English summary) 2004d:68074
— (with Sakakibara, Naoto; Jimbo, Shuji) Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids. ...
Axiomatizing Omega and Omega-op Powers of Words
2002
BRICS Report Series
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Wilke algebras are called "binoids" in [16] .
In the field of Combinatorics on Words, a "primitive word" is a finite nonempty word which is not a proper power. ...
We conjecture that the variety generated by algebras of words has a finite axiomatization over the variety of all iteration algebras. ...
doi:10.7146/brics.v9i41.21756
fatcat:gpy2jr4kbnhlzj5p5ozejjwmmy
Semigroups and Automata on Infinite Words
[chapter]
1995
Semigroups, Formal Languages and Groups
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
The solution consists in coding infinite paths not by square matrices, but by column matrices, in such a way that each coefficient µ(u) p codes the existence of an infinite path of label u starting at ...
It is easy to extend µ to a semigroup morphism from A + to the multiplicative semigroup of Q × Q-matrices over k. ...
doi:10.1007/978-94-011-0149-3_3
fatcat:baawnkgzrbdenmohs5wv3mgr6y
The Shape of Hilbert-Kunz Functions
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
To Uli Walther for discussions on the Macaulay 2 codes. To Holger Brenner and Claudia Miller for insightful conversations offering support and many crucial references. ...
Hence, as a a direct summand of a finitely generated free module over a local ring, K p is a free module. ...
Viewing M • as a complex over S, we take a finite free resolution H • of M • over S. Consider the class [S] defined by the zero ideal in the Chow group A * (S). ...
arXiv:2106.14053v1
fatcat:jxxd5amrlndzfg7kgxeozzivu4
Axiomatizing omega and omega-op powers of words
2004
RAIRO - Theoretical Informatics and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Introduction The theory of finite automata and regular languages on finite words has been generalized to various linear and nonlinear structures. ...
These words arise as initial solutions of finite systems of recursion equations. ...
Wilke algebras are called "binoids" in [16] .
In the field of Combinatorics on Words, a "primitive word" is a finite nonempty word which is not a proper power. ...
doi:10.1051/ita:2004005
fatcat:7ep34hl45ndq5et5qeifld5mji
Page 963 of Mathematical Reviews Vol. , Issue Index
[page]
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
(see 2004k:53001) 53B20 Hashiguchi, Kosaburo (with Kunai, Takahiro; Jimbo, Shuji) Finite codes over free binoids. ...
(Pascal Weil) 2004d:68074 68Q45 (68Q42)
— (with Sakakibara, Naoto; Jimbo, Shuji) Equivalence of regular binoid expressions and regular expressions denoting binoid languages over free binoids. ...
« Previous
Showing results 1 — 15 out of 25 results