Miklós Bartha

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