Zobrazeno 1 - 10
of 93
pro vyhledávání: '"Stephen L. Bloom"'
Autor:
Yi Di Zhang, Stephen L. Bloom
Publikováno v:
Order. 30:151-164
We prove the following theorem. Suppose that M is a trim DFA. Then \(\mathcal{L}(M)\) is well-ordered by the lexicographic order < l iff whenever the non sink states q, q.0 are in the same strong component, then q.1 is a sink. It is easy to see that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b56c1e5a457cb5dfc2367116c65d36d6
https://doi.org/10.1007/s11083-011-9233-1
https://doi.org/10.1007/s11083-011-9233-1
Autor:
Zoltán Ésik, Stephen L. Bloom
Publikováno v:
Theoretical Computer Science. 411:341-359
The main result of this paper is a generalization of the Mezei-Wright theorem, a result on solutions of a system of fixed point equations. In the typical setting, one solves a system of fixed point equations in an algebra equipped with a suitable par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a911981275dd0e37f3daea252ba4439d
https://doi.org/10.1016/j.tcs.2009.06.040
https://doi.org/10.1016/j.tcs.2009.06.040
Publikováno v:
Journal of Logic and Computation. 18:1047-1085
Several concepts of algebras with solutions of recursive equation systems are compared: CPO-enrichable algebras are proved to be iteration algebras of Z. Esik, and iteration algebras are a special case of the recently introduced Elgot algebras (which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ed1ebd0f90cb049e93721a46242dd08
https://doi.org/10.1093/logcom/exn035
https://doi.org/10.1093/logcom/exn035
Autor:
Zoltán ísik, Stephen L. Bloom
Publikováno v:
Information and Computation. 197(1-2):55-89
Courcelle introduced the study of regular words, i.e., words isomorphic to frontiers of regular trees. Heilbrunner showed that a nonempty word is regular iff it can be generated from the singletons by the operations of concatenation, omega power, ome
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2c15f1cb40ff92d72b536a16c3bf85f7
Autor:
Stephen L. Bloom, Zoltán Ésik
Publikováno v:
CTCS
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7cb30d90e937fe6550803f1b701e7447
https://doi.org/10.1016/s1571-0661(04)80558-9
https://doi.org/10.1016/s1571-0661(04)80558-9
Publikováno v:
Applied Categorical Structures. 9:173-216
The axioms of iteration 2-theories capture, up to isomorphism, the equational properties of iteration in conjunction with horizontal and vertical composition in all algebraically complete categories. We give a concrete representation of the free iter
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87e3143e16543f50396daa8e33a8559d
https://doi.org/10.1023/a:1008708924144
https://doi.org/10.1023/a:1008708924144
Autor:
Stephen L. Bloom, Zoltan Esik
This monograph contains the results of our joint research over the last ten years on the logic of the fixed point operation. The intended au dience consists of graduate students and research scientists interested in mathematical treatments of seman
Autor:
Calvin C. Elgot, Stephen L. Bloom
Cal Elgot was a very serious and thoughtful researcher, who with great determi nation attempted to find basic explanations for certain mathematical phenomena as the selection of papers in this volume well illustrate. His approach was, for the mos
Autor:
Stephen L. Bloom, Zoltán Ésik
Publikováno v:
Mathematical Structures in Computer Science. 7:701-713
A V-labelled poset P can induce an operation on the languages on any fixed alphabet, as well as an operation on labelled posets (as noticed by Pratt and Gischer (Pratt 1986; Gischer 1988)). For any collection X of V-labelled posets and any alphabet
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47eafc0289f6f02a309096373ac14819
https://doi.org/10.1017/s0960129597002442
https://doi.org/10.1017/s0960129597002442
Autor:
Stephen L. Bloom, Zoltán Ésik
Publikováno v:
Information and Computation. 139(1):62-91
We consider the varietyLanggenerated by all language structures (PΣ, ·, ⊗ +, 0, 1), and the varietyLg⩽of ordered algebras generated by the structures (PΣ, ·, ⊗ 0, 1, ⊆), wherePΣis the powerset ofΣ*, and whereB·Cis the complex concatena
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7996c11e171710e6877c3b31f6b9c32e