Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Balázs Imreh"'
Publikováno v:
Optimization and Engineering. 10:351-361
Process Network Synthesis (PNS) has an enormous practical impact. The problem is very difficult to solve, determining the cost optimal network of operating units with fixed charge belongs to the complexity class of NP-hard problems. Therefore, it is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e4f5c299daf21bfc02738a734db1831f
https://doi.org/10.1007/s11081-008-9054-2
https://doi.org/10.1007/s11081-008-9054-2
Publikováno v:
Scopus-Elsevier
Subdirect decompositions of unary algebras are studied in connection with one-element subalgebras, cores, Rees extensions of congruences of subalgebras, dense extensions and disjunctive elements. In particular, subdirectly irreducible unary algebras
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4620931a67239ec01fb7acc9600e4fae
https://doi.org/10.3233/fi-1999-381205
https://doi.org/10.3233/fi-1999-381205
Autor:
Balázs Imreh, Ferenc Gécseg
Publikováno v:
Acta Mathematica Hungarica. 68:151-159
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cf2a1d606c22c4c5c353dd9dfe1360f5
https://doi.org/10.1007/bf01874441
https://doi.org/10.1007/bf01874441
Publikováno v:
Words, Languages & Combinatorics III.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a8a339eff5cb102f6f7f4b91cdec726
https://doi.org/10.1142/9789812704979_0016
https://doi.org/10.1142/9789812704979_0016
Publikováno v:
Topics in Computer Mathematics ISBN: 9780415298858
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b28f1c368e938a1b4322690ceba2c06f
https://doi.org/10.1201/9780203009642.ch14
https://doi.org/10.1201/9780203009642.ch14
Autor:
Balázs Imreh
Publikováno v:
Developments in Language Theory ISBN: 9783540404316
Developments in Language Theory
Developments in Language Theory
This paper is concerned with the class of all asynchronous automata.We characterize isomorphically complete systems for this class with respect to the ai-products and present a description of languages accepted by asynchronous automata.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e7713544e5db274c061c0fe7d139136
https://doi.org/10.1007/3-540-45005-x_25
https://doi.org/10.1007/3-540-45005-x_25
Autor:
Balázs Imreh, Ferenc Gécseg
Publikováno v:
Words, Semigroups, and Transductions: Festschrift in Honor of Gabriel Thierrin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9f2d84e23197587b6d52c36b4ac5596c
https://doi.org/10.1142/9789812810908_0011
https://doi.org/10.1142/9789812810908_0011
Autor:
Balázs Imreh, Masami Ito
Publikováno v:
Jewels are Forever ISBN: 9783642643040
Jewels are Forever
Jewels are Forever
In [5], the directable non deterministic automata are studied. For non-deterministic automata, the directability can be defined in several ways. In each case considered, the directing words constitute a regular language and one can study the families
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c7ca7b9bab690152cbb7b9869462202
https://doi.org/10.1007/978-3-642-60207-8_3
https://doi.org/10.1007/978-3-642-60207-8_3
Publikováno v:
Optimization & Engineering; Sep2009, Vol. 10 Issue 3, p351-361, 11p
Publikováno v:
Fundamentals of Computation Theory ISBN: 9783540514985
FCT
FCT
We have seen that, with respect to homomorphic realization, the ν i —products behave in a way similar to the α i —products on classes satisfying the Leticevskii criterion or not satisfying the Leticevskii criteria. In particular, a class K is h
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92c456eaf85dbbe568216ff6504ec894
https://doi.org/10.1007/3-540-51498-8_13
https://doi.org/10.1007/3-540-51498-8_13