default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiklós Bartha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j21]Miklós Bartha
, Miklós Krész:
On the König deficiency of zero-reducible graphs. J. Comb. Optim. 39(1): 273-292 (2020)
2010 – 2019
- 2017
- [j20]Miklós Bartha:
On the Completeness of the Traced Monoidal Category Axioms in (Rel, +). Acta Cybern. 23(1): 327-347 (2017) - 2013
- [j19]Miklós Bartha:
The monoidal structure of Turing machines. Math. Struct. Comput. Sci. 23(2): 204-246 (2013) - 2012
- [c10]Miklós Bartha:
Quantum Turing automata. DCM 2012: 17-31 - 2011
- [c9]Miklós Bartha, Miklós Krész:
Molecular Switching by Turing Automata. NCMA 2011: 51-71 - 2010
- [c8]Miklós Bartha:
Turing Automata and Graph Machines. DCM 2010: 19-31 - [p1]Miklós Bartha, Miklós Krész:
Soliton Circuits and Network-Based Automata: Review and Perspectives. Scientific Applications of Language Methods 2010: 585-631
2000 – 2009
- 2009
- [j18]Miklós Bartha, Miklós Krész:
Deciding the deterministic property for soliton graphs. Ars Math. Contemp. 2(1): 121-136 (2009) - [c7]Miklós Bartha:
Equivalence Relations of Mealy Automata. NCMA 2009: 31-46 - [c6]Miklós Bartha, Miklós Krész:
A Depth-first Algorithm to Reduce Graphs in Linear Time. SYNASC 2009: 273-281 - 2008
- [j17]Miklós Bartha, Miklós Krész:
Splitters and Barriers in Open Graphs Having a Perfect Internal Matching. Acta Cybern. 18(4): 697-718 (2008) - [c5]Miklós Bartha:
Simulation equivalence of automata and circuits. AFL 2008: 86-99 - 2006
- [j16]Miklós Bartha, Miklós Krész:
Deterministic Soliton Graphs. Informatica (Slovenia) 30(3): 281-288 (2006) - [c4]Miklós Bartha, Miklós Krész:
Flexible Matchings. WG 2006: 313-324 - 2005
- [c3]Miklós Bartha:
Strong Retiming Equivalence of Synchronous Schemes. CIAA 2005: 66-77 - 2004
- [j15]Miklós Bartha, Miklós Krész:
Tutte type theorems for graphs having a perfect internal matching. Inf. Process. Lett. 91(6): 277-284 (2004) - 2003
- [j14]Miklós Bartha, Miklós Krész:
Structuring the elementary components of graphs having a perfect internal matching. Theor. Comput. Sci. 299(1-3): 179-210 (2003) - 2000
- [j13]Miklós Bartha, Miklós Krész:
Elementary decomposition of soliton automata. Acta Cybern. 14(4): 631-652 (2000)
1990 – 1999
- 1995
- [j12]Miklós Bartha, Éva Gombás:
On Graphs with Perfect Internal Matchings. Acta Cybern. 12(2): 111-124 (1995) - 1992
- [j11]Miklós Bartha:
An Algebraic Model of Synchronous Systems. Inf. Comput. 97(1): 97-131 (1992) - [j10]Miklós Bartha:
Foundations of a Theory of Synchronous Systems. Theor. Comput. Sci. 100(2): 325-346 (1992) - 1991
- [j9]Miklós Bartha, Éva Gombás:
A Structure Theorem for Maximum Internal Matchings in Graphs. Inf. Process. Lett. 40(6): 289-294 (1991)
1980 – 1989
- 1989
- [j8]Éva Gombás, Miklós Bartha:
Two transformations on attribute grammars improving the complexity of their evaluation. Acta Cybern. 9(1): 55-72 (1989) - [c2]Miklós Bartha:
Interpretations of Synchronous Flowchart Schemes. FCT 1989: 25-34 - 1987
- [j7]Miklós Bartha:
A finite axiomatization of flowchart schemes. Acta Cybern. 8(2): 203-217 (1987) - [j6]Miklós Bartha:
An Equational Axiomatization of Systolic Systems. Theor. Comput. Sci. 55(2-3): 265-289 (1987) - 1985
- [j5]Éva Gombás, Miklós Bartha:
A multi-visti charaterization of absolutely noncircular attribute grammars. Acta Cybern. 7(1): 19-31 (1985) - [j4]Éva Gombás, Miklós Bartha:
Atomic characterizations of uniform multi-pass attribute grammars. Acta Cybern. 7(2): 155-172 (1985) - 1984
- [j3]Miklós Bartha:
On injective attributed characterization of 2-way deterministic finite state transducers. Acta Cybern. 6(4): 347-353 (1984) - 1983
- [j2]Miklós Bartha:
Linear deterministic attributed transformations. Acta Cybern. 6(2): 125-147 (1983) - 1982
- [j1]Miklós Bartha:
An algebraic definition of attributed transformations. Acta Cybern. 5(4): 409-421 (1982) - 1981
- [c1]Miklós Bartha:
An Algebraic Defenition of Attributed Transformations. FCT 1981: 51-60
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 2025-01-21 00:20 CET 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:
