Miklós Bartha

Publication Activity (10 Years)

Years Active: 1981-2020
Publications (10 Years): 2

Top Topics

Hierarchical Structure

Regular Expressions

Subgraph Isomorphism

Top Venues

Math. Struct. Comput. Sci.

J. Comb. Optim.

Publications

Miklós Bartha, Miklós Krész
On the König deficiency of zero-reducible graphs. J. Comb. Optim. 39 (1) (2020)
Miklós Bartha
On the Completeness of the Traced Monoidal Category Axioms in (Rel, +). Acta Cybern. 23 (1) (2017)
Miklós Bartha
The monoidal structure of Turing machines. Math. Struct. Comput. Sci. 23 (2) (2013)
Miklós Bartha
Quantum Turing automata. DCM (2012)
Miklós Bartha, Miklós Krész
Molecular Switching by Turing Automata. NCMA (2011)
Miklós Bartha
Turing Automata and Graph Machines DCM (2010)
Miklós Bartha, Miklós Krész
A Depth-first Algorithm to Reduce Graphs in Linear Time. SYNASC (2009)
Miklós Bartha
Equivalence Relations of Mealy Automata. NCMA (2009)
Miklós Bartha, Miklós Krész
Deciding the deterministic property for soliton graphs. Ars Math. Contemp. 2 (1) (2009)
Miklós Bartha, Miklós Krész
Splitters and Barriers in Open Graphs Having a Perfect Internal Matching. Acta Cybern. 18 (4) (2008)
Miklós Bartha
Simulation equivalence of automata and circuits. AFL (2008)
Miklós Bartha, Miklós Krész
Flexible Matchings. WG (2006)
Miklós Bartha, Miklós Krész
Deterministic Soliton Graphs. Informatica (Slovenia) 30 (3) (2006)
Miklós Bartha
Strong Retiming Equivalence of Synchronous Schemes. CIAA (2005)
Miklós Bartha, Miklós Krész
Tutte type theorems for graphs having a perfect internal matching. Inf. Process. Lett. 91 (6) (2004)
Miklós Bartha, Miklós Krész
Structuring the elementary components of graphs having a perfect internal matching. Theor. Comput. Sci. 299 (1-3) (2003)
Miklós Bartha, Miklós Krész
Elementary decomposition of soliton automata. Acta Cybern. 14 (4) (2000)
Miklós Bartha, Éva Gombás
On Graphs with Perfect Internal Matchings. Acta Cybern. 12 (2) (1995)
Miklós Bartha
An Algebraic Model of Synchronous Systems Inf. Comput. 97 (1) (1992)
Miklós Bartha
Foundations of a Theory of Synchronous Systems. Theor. Comput. Sci. 100 (2) (1992)
Miklós Bartha, Éva Gombás
A Structure Theorem for Maximum Internal Matchings in Graphs. Inf. Process. Lett. 40 (6) (1991)
Miklós Bartha
Interpretations of Synchronous Flowchart Schemes. FCT (1989)
Éva Gombás, Miklós Bartha
Two transformations on attribute grammars improving the complexity of their evaluation. Acta Cybern. 9 (1) (1989)
Miklós Bartha
An Equational Axiomatization of Systolic Systems. Theor. Comput. Sci. 55 (2-3) (1987)
Miklós Bartha
A finite axiomatization of flowchart schemes. Acta Cybern. 8 (2) (1987)
Éva Gombás, Miklós Bartha
Atomic characterizations of uniform multi-pass attribute grammars. Acta Cybern. 7 (2) (1985)
Éva Gombás, Miklós Bartha
A multi-visti charaterization of absolutely noncircular attribute grammars. Acta Cybern. 7 (1) (1985)
Miklós Bartha
On injective attributed characterization of 2-way deterministic finite state transducers. Acta Cybern. 6 (4) (1984)
Miklós Bartha
Linear deterministic attributed transformations. Acta Cybern. 6 (2) (1983)
Miklós Bartha
An algebraic definition of attributed transformations. Acta Cybern. 5 (4) (1982)
Miklós Bartha
An Algebraic Defenition of Attributed Transformations. FCT (1981)