Zobrazeno 1 - 10
of 572
pro vyhledávání: '"Syntactic monoid"'
Publikováno v:
International Journal of Applied Mathematics and Computer Science, Vol 31, Iss 2, Pp 337-351 (2021)
Beta-thalassemia is an autosomal recessive blood disorder characterized by abnormalities in the synthesis of β globin. Together with α globin, it is a subunit of globin protein, called hemoglobin, located inside our red blood cells to deliver oxyge
Externí odkaz:
https://doaj.org/article/ebffc514ac9b453b8511b19988b8f37e
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Proceedings of the American Mathematical Society, 1996 Mar 01. 124(3), 655-663.
Externí odkaz:
https://www.jstor.org/stable/2161926
Autor:
Thierrin, G.
Publikováno v:
Proceedings of the American Mathematical Society, 1981 Oct 01. 83(2), 255-258.
Externí odkaz:
https://www.jstor.org/stable/2043506
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030719944
FoSSaCS
FoSSaCS
We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the ‘canonical boolean representation’ of the syntactic monoid. Equivalently, it is the least number of state
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7471ce00d9f5ebc9be8c18b66bbc9fc
https://doi.org/10.1007/978-3-030-71995-1_23
https://doi.org/10.1007/978-3-030-71995-1_23
Publikováno v:
Developments in Language Theory ISBN: 9783030815073
DLT
DLT
Traditionally, graph algorithms get a single graph as input, and then they should decide if this graph satisfies a certain property \(\varPhi \). What happens if this question is modified in a way that we get a possibly infinite family of graphs as a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e50e044d647a9a6e00496d23504878f2
https://doi.org/10.1007/978-3-030-81508-0_10
https://doi.org/10.1007/978-3-030-81508-0_10
Autor:
Howard Straubing
Publikováno v:
ACM SIGLOG News. 5:4-20
A fundamental result about formal languages states: Theorem 1 A regular language is first-order definable if and only if its syntactic monoid contains no nontrivial groups. Rest assured, we will explain in the next section exactly what the various te
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e2943ad46578e4ae71e035821b74ec35
https://doi.org/10.1145/3242953.3242956
https://doi.org/10.1145/3242953.3242956
Publikováno v:
Daviaud, L, Johnson, M & Kambites, M 2018, ' IDENTITIES IN UPPER TRIANGULAR TROPICAL MATRIX SEMIGROUPS AND THE BICYCLIC MONOID ', Journal of Algebra, vol. 501, pp. 503-525 . https://doi.org/10.1016/j.jalgebra.2017.12.032
We establish necessary and sufficient conditions for a semigroup identity to hold in the monoid of $n\times n$ upper triangular tropical matrices, in terms of equivalence of certain tropical polynomials. This leads to an algorithm for checking whethe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::18fcf0d0d6e9f8d3faa47dd460b885be
https://doi.org/10.1016/j.jalgebra.2017.12.032
https://doi.org/10.1016/j.jalgebra.2017.12.032
Autor:
Tobias Walter
Publikováno v:
Theoretical Computer Science. 702:34-47
In this paper the concept of Parikh-reducing Church–Rosser systems is studied. It is shown that for two classes of regular languages there exist such systems which describe the languages using finitely many equivalence classes of the rewriting syst
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e632e34a63b1e776db7c4ba69bdf4d9
https://doi.org/10.1016/j.tcs.2017.08.009
https://doi.org/10.1016/j.tcs.2017.08.009
Autor:
Alex Patchkoria
Publikováno v:
Semigroup Forum. 97:131-153
We relate the old and new cohomology monoids of an arbitrary monoid $M$ with coefficients in semimodules over $M$, introduced in the author's previous papers, to monoid and group extensions. More precisely, the old and new second cohomology monoids d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5ddadbf7f69d8d35ba9d4cd9910d0d1f
https://doi.org/10.1007/s00233-017-9900-7
https://doi.org/10.1007/s00233-017-9900-7