An Algebraic Defenition of Attributed Transformations. - Miklós Bartha (FCT, 1981)

An algebraic definition of attributed transformations. - Miklós Bartha (Acta Cybern., 1982)

Linear deterministic attributed transformations. - Miklós Bartha (Acta Cybern., 1983)

On injective attributed characterization of 2-way deterministic finite state transducers. - Miklós Bartha (Acta Cybern., 1984)

A multi-visti charaterization of absolutely noncircular attribute grammars. - Éva Gombás; Miklós Bartha (Acta Cybern., 1985)

Atomic characterizations of uniform multi-pass attribute grammars. - Éva Gombás; Miklós Bartha (Acta Cybern., 1985)

A finite axiomatization of flowchart schemes. - Miklós Bartha (Acta Cybern., 1987)

An Equational Axiomatization of Systolic Systems. - Miklós Bartha (Theor. Comput. Sci., 1987)

Interpretations of Synchronous Flowchart Schemes. - Miklós Bartha (FCT, 1989)

Two transformations on attribute grammars improving the complexity of their evaluation. - Éva Gombás; Miklós Bartha (Acta Cybern., 1989)

A Structure Theorem for Maximum Internal Matchings in Graphs. - Miklós Bartha; Éva Gombás (Inf. Process. Lett., 1991)

Foundations of a Theory of Synchronous Systems. - Miklós Bartha (Theor. Comput. Sci., 1992)

An Algebraic Model of Synchronous Systems - Miklós Bartha (Inf. Comput., 1992)

On Graphs with Perfect Internal Matchings. - Miklós Bartha; Éva Gombás (Acta Cybern., 1995)

Elementary decomposition of soliton automata. - Miklós Bartha; Miklós Krész (Acta Cybern., 2000)

Structuring the elementary components of graphs having a perfect internal matching. - Miklós Bartha; Miklós Krész (Theor. Comput. Sci., 2003)

Tutte type theorems for graphs having a perfect internal matching. - Miklós Bartha; Miklós Krész (Inf. Process. Lett., 2004)

Strong Retiming Equivalence of Synchronous Schemes. - Miklós Bartha (CIAA, 2005)

Flexible Matchings. - Miklós Bartha; Miklós Krész (WG, 2006)

Deterministic Soliton Graphs. - Miklós Bartha; Miklós Krész (Informatica (Slovenia), 2006)

Simulation equivalence of automata and circuits. - Miklós Bartha (AFL, 2008)

Splitters and Barriers in Open Graphs Having a Perfect Internal Matching. - Miklós Bartha; Miklós Krész (Acta Cybern., 2008)

Equivalence Relations of Mealy Automata. - Miklós Bartha (NCMA, 2009)

A Depth-first Algorithm to Reduce Graphs in Linear Time. - Miklós Bartha; Miklós Krész (SYNASC, 2009)

Deciding the deterministic property for soliton graphs. - Miklós Bartha; Miklós Krész (Ars Math. Contemp., 2009)

Soliton Circuits and Network-Based Automata: Review and Perspectives. - Miklós Bartha; Miklós Krész (Scientific Applications of Language Methods, 2010)

Turing Automata and Graph Machines - Miklós Bartha (DCM, 2010)

Molecular Switching by Turing Automata. - Miklós Bartha; Miklós Krész (NCMA, 2011)

Quantum Turing automata. - Miklós Bartha (DCM, 2012)

The monoidal structure of Turing machines. - Miklós Bartha (Math. Struct. Comput. Sci., 2013)

On the Completeness of the Traced Monoidal Category Axioms in (Rel, +). - Miklós Bartha (Acta Cybern., 2017)

On the König deficiency of zero-reducible graphs. - Miklós Bartha; Miklós Krész (J. Comb. Optim., 2020)