default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBalázs Imreh
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j37]Ferenc Gécseg, Balázs Imreh:
On Asynchronous Tree Automata. J. Autom. Lang. Comb. 11(2): 161-168 (2006)- 2005
- [j36]Balázs Imreh, Masami Ito:
On regular languages determined by nondeterministic directable automata. Acta Cybern. 17(1): 1-10 (2005) - 2004
- [j35]Ferenc Gécseg, Balázs Imreh:
On Definite and Nilpotent DR Tree Languages. J. Autom. Lang. Comb. 9(1): 55-60 (2004) - 2003
- [j34]Balázs Imreh, Csanád Imreh, Masami Ito:
On directable nondeterministic trapped automata. Acta Cybern. 16(1): 37-45 (2003) - [j33]Balázs Imreh, Csanád Imreh, Masami Ito:
On Monotonic Directable Nondeterministic Automata. J. Autom. Lang. Comb. 8(3): 539-547 (2003) - [c8]Balázs Imreh, Masami Ito, Magnus Steinby:
On Commutative Directable Nondeterministic Automata. Grammars and Automata for String Processing 2003: 141-150 - 2002
- [j32]Balázs Imreh:
Automaton Theory Approach for Solving Modified PNS Problems. Acta Cybern. 15(3): 327-338 (2002) - [j31]Ferenc Gécseg, Balázs Imreh:
On Monotone Automata and Monotone Languages. J. Autom. Lang. Comb. 7(1): 71-82 (2002) - [c7]Balázs Imreh:
Some Remarks on Asynchronous Automata. Developments in Language Theory 2002: 290-296 - 2001
- [j30]Ferenc Gécseg, Balázs Imreh:
On isomorphic representations of generalized definite automata. Acta Cybern. 15(1): 33-43 (2001) - [c6]Ferenc Gécseg, Balázs Imreh:
On Isomorphic Representations of Monotone Tree and Nondeterministic Tree . Words, Semigroups, and Transductions 2001: 141-154 - 2000
- [j29]Balázs Imreh, János Fülöp, Ferenc Friedler:
A Note on the Equivalence of the Set Covering and Process Network Synthesis Problems. Acta Cybern. 14(3): 497-502 (2000) - [j28]Balázs Imreh, Masami Ito, Antal Pukler:
On commutative asynchronous nondeterministic automata. Acta Cybern. 14(4): 607-617 (2000) - [j27]Balázs Imreh:
On the equivalence of the cube-product and the general product of automata. Theor. Comput. Sci. 245(1): 103-113 (2000) - [c5]Balázs Imreh, Masami Ito, Antal Pukler:
On Commutative Asynchronous Automata. Words, Languages & Combinatorics 2000: 212-221
1990 – 1999
- 1999
- [j26]Balázs Imreh, Masami Ito:
A Note on the Star-Product. Acta Cybern. 14(1): 99-104 (1999) - [j25]Balázs Imreh, Magnus Steinby:
Directable Nondeterministic Automata. Acta Cybern. 14(1): 105-115 (1999) - [j24]Stojan Bogdanovic, Miroslav Ciric, Tatjana Petkovic, Balázs Imreh, Magnus Steinby:
Traps, Cores, Extensions and Subdirect Decompositions of Unary Algebras. Fundam. Informaticae 38(1-2): 51-60 (1999) - [c4]Balázs Imreh, Masami Ito:
On Some Special Classes of Regular Languages. Jewels are Forever 1999: 25-34 - 1998
- [j23]Zoltán Blázsik, Cs. Holló, Balázs Imreh:
On Decision-Mappings Related to Process Network Synthesis Problem. Acta Cybern. 13(3): 319-328 (1998) - [j22]János Fülöp, Balázs Imreh, Ferenc Friedler:
On the Reformulation of Some Classes of PNS-Problems as Set Covering Problems. Acta Cybern. 13(3): 329-337 (1998) - [j21]Ferenc Gécseg, Balázs Imreh, András Pluhár:
On the Existence of Finite Isomorphically Complete Systems of Automata. J. Autom. Lang. Comb. 3(2): 77-84 (1998) - [j20]Ferenc Friedler, L. T. Fan, Balázs Imreh:
Process network synthesis: Problem definition. Networks 31(2): 119-124 (1998) - 1997
- [j19]Balázs Imreh:
On alphai-Products of Nondeterministic Tree Automata. Acta Cybern. 13(1): 41-54 (1997) - [c3]Ferenc Gécseg, Balázs Imreh:
On complete sets of tree automata. Developments in Language Theory 1997: 37-47 - 1996
- [j18]Zoltán Blázsik, Balázs Imreh:
A Note on Connection Between PNS and Set Covering Problems. Acta Cybern. 12(3): 309-312 (1996) - [c2]Balázs Imreh, Masami Ito, Masashi Katsura:
On Shuffle Closure of Commutative Regular Languages. DMTCS 1996: 276-288 - 1995
- [j17]Balázs Imreh:
On Isomorphic Representation of Nondeterministic Tree Automata. Acta Cybern. 12(1): 11-21 (1995) - [j16]Balázs Imreh, Magnus Steinby:
Some Remarks on Directable Automata. Acta Cybern. 12(1): 23-35 (1995) - [j15]I. Bartalos, T. Dudás, Balázs Imreh:
On a Tour Construction Heuristic for the Asymmetric TSP. Acta Cybern. 12(2): 209-216 (1995) - 1994
- [j14]Balázs Imreh, A. M. Ito:
A Note on Regular Strongly Shuffle-Closed Languages. Acta Cybern. 11(4): 257-260 (1994) - 1992
- [j13]Balázs Imreh:
On a Special Composition of Tree Automata. Acta Cybern. 10(4): 237-242 (1992) - [j12]Ferenc Gécseg, Balázs Imreh:
Finite isomorphically complete systems. Discret. Appl. Math. 36(3): 307-311 (1992)
1980 – 1989
- 1989
- [j11]János Csirik, Balázs Imreh:
On the worst-case performance of the NkF bin-packing heuristic. Acta Cybern. 9(2): 89-105 (1989) - [j10]Ferenc Gécseg, Balázs Imreh:
On star-products of automata. Acta Cybern. 9(2): 167-172 (1989) - [c1]Pál Dömösi, Zoltán Ésik, Balázs Imreh:
On Product Hierarchies of Automata. FCT 1989: 137-144 - 1988
- [j9]Balázs Imreh:
A note on the generalized νi-product. Acta Cybern. 8(3): 247-252 (1988) - 1987
- [j8]Ferenc Gécseg, Balázs Imreh:
On isomorphic metric equivalence of νi. Acta Cybern. 8(2): 129-134 (1987) - 1985
- [j7]Balázs Imreh:
On finite definite automata. Acta Cybern. 7(1): 61-65 (1985) - 1983
- [j6]Pál Dömösi, Balázs Imreh:
On νi-products of automata. Acta Cybern. 6(2): 149-162 (1983) - 1981
- [j5]Zoltán Ésik, Balázs Imreh:
Remarks on finite commutative automata. Acta Cybern. 5(2): 143-146 (1981) - [j4]Zoltán Ésik, Balázs Imreh:
Subdirectly irreducible commutative automata. Acta Cybern. 5(3): 251-260 (1981) - [j3]Balázs Imreh:
On finite nilpotent automata. Acta Cybern. 5(3): 281-293 (1981) - 1980
- [j2]Balázs Imreh:
On isomorphic representations of commutative automata with respect to αi-products. Acta Cybern. 5(1): 21-32 (1980)
1970 – 1979
- 1977
- [j1]Balázs Imreh:
On αi-products of automata. Acta Cybern. 3(4): 301-307 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
