Zobrazeno 1 - 10
of 539
pro vyhledávání: '"canonical words"'
Autor:
Brzozowski, Janusz1 brzozo@uwaterloo.ca, Jürgensen, Helmut2,3
Publikováno v:
International Journal of Foundations of Computer Science. Oct2005, Vol. 16 Issue 5, p831-850. 20p.
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:
AIMS Mathematics, Vol 7, Iss 9, Pp 17080-17090 (2022)
Hilbert series is a simplest way to calculate the dimension and the degree of an algebraic variety by an explicit polynomial equation. The mixed braid group $ B_{m, n} $ is a subgroup of the Artin braid group $ B_{m+n} $. In this paper we find the am
Externí odkaz:
https://doaj.org/article/db49b248842543c2af8de4647aa5066c
Autor:
Janusz A. Brzozowski
Publikováno v:
Theoretical Computer Science. 356:46-57
It has been shown recently that deterministic semiautomata can be represented by canonical words and equivalences; that work was motivated by the trace-assertion method for specifying software modules. Here, we generalize these ideas to a class of no
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7a8f58d1bf3877fbd15c03d592ec940
https://doi.org/10.1016/j.tcs.2006.01.040
https://doi.org/10.1016/j.tcs.2006.01.040
Autor:
JANUSZ BRZOZOWSKI, HELMUT JÜRGENSEN
Publikováno v:
International Journal of Foundations of Computer Science. 16:831-850
We study a novel representation of semiautomata, which is motivated by the method of trace-assertion specifications of software modules. Each state of the semiautomaton is represented by an arbitrary word leading to that state, the canonical word. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::48a275a4ec90fa59ebef5d396937e01e
https://doi.org/10.1142/s0129054105003327
https://doi.org/10.1142/s0129054105003327
Autor:
Helmut Jürgensen, Janusz A. Brzozowski
Publikováno v:
International Journal of Foundations of Computer Science. 18:1065-1087
A theory of representation of semiautomata by canonical words and equivalences was developed in [7]. That work was motivated by trace-assertion specifications of software modules, but its focus was entirely on the underlying mathematical model. In th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3a1bcf5d3c715c5cf97181842f41899a
https://doi.org/10.1142/s0129054107005133
https://doi.org/10.1142/s0129054107005133
Autor:
Brzozowski, J. A., Jürgensen, Helmut
We study a novel representation of semiautomata, which is motivated by the method of trace-assertion specifications of software modules. Each state of the semiautomaton is represented by an arbitrary word leading to that state, the canonical word. Th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______266::d30c6135b38873dda73e5190c77dc2b3
https://publishup.uni-potsdam.de/frontdoor/index/index/docId/13533
https://publishup.uni-potsdam.de/frontdoor/index/index/docId/13533
Autor:
D'Andrea, Alessandro1 a.dandrea@unibo.it, Stella, Salvatore2 salvatore.stella@univaq.it
Publikováno v:
Bulletin of the Belgian Mathematical Society - Simon Stevin. Dec2023, Vol. 30 Issue 5, p570-576. 7p.
Autor:
Helmut Jürgensen, Janusz A. Brzozowski
Publikováno v:
International Journal of Foundations of Computer Science. 17:1231-1232
In the paper [1], Theorem 23 and Example 24 are incorrect. The corrected version is presented in this note.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::684e13352f9efa6b4c7d5c334390f7ba
https://doi.org/10.1142/s0129054106004364
https://doi.org/10.1142/s0129054106004364