Miklós Bartha

J. Comb. Optim., 2020

2017

On the Completeness of the Traced Monoidal Category Axioms in (Rel, +).

[BibT_eX]

[DOI]

Acta Cybern., 2017

2013

The monoidal structure of Turing machines.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2013

2012

Quantum Turing automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 8th International Workshop on Developments in Computational Models, 2012

2011

Molecular Switching by Turing Automata.

[BibT_eX]

Proceedings of the Third Workshop on Non-Classical Models for Automata and Applications - NCMA 2011, Milan, Italy, July 18, 2011

2010

Turing Automata and Graph Machines

[BibT_eX]

[DOI]

Proceedings of the Proceedings Sixth Workshop on Developments in Computational Models: Causality, 2010

Soliton Circuits and Network-Based Automata: Review and Perspectives.

[BibT_eX]

Proceedings of the Scientific Applications of Language Methods., 2010

2009

Deciding the deterministic property for soliton graphs.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2009

A Depth-first Algorithm to Reduce Graphs in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2009

Equivalence Relations of Mealy Automata.

[BibT_eX]

Proceedings of the Workshop on Non-Classical Models for Automata and Applications - NCMA 2009, Wroclaw, Poland, August 31, 2009

2008

Splitters and Barriers in Open Graphs Having a Perfect Internal Matching.

[BibT_eX]

[DOI]

Acta Cybern., 2008

Simulation equivalence of automata and circuits.

[BibT_eX]

Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2006

Deterministic Soliton Graphs.

[BibT_eX]

[DOI]

Informatica (Slovenia), 2006

Flexible Matchings.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

2005

Strong Retiming Equivalence of Synchronous Schemes.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2005

2004

Tutte type theorems for graphs having a perfect internal matching.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

2003

Structuring the elementary components of graphs having a perfect internal matching.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2000

Elementary decomposition of soliton automata.

[BibT_eX]

[DOI]

Acta Cybern., 2000

1995

On Graphs with Perfect Internal Matchings.

[BibT_eX]

[DOI]

Acta Cybern., 1995

1992

An Algebraic Model of Synchronous Systems

[BibT_eX]

[DOI]

Inf. Comput., March, 1992

Foundations of a Theory of Synchronous Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

1991

A Structure Theorem for Maximum Internal Matchings in Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1991

1989

Two transformations on attribute grammars improving the complexity of their evaluation.

[BibT_eX]

[DOI]

Acta Cybern., 1989

Interpretations of Synchronous Flowchart Schemes.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1989

1987

An Equational Axiomatization of Systolic Systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

A finite axiomatization of flowchart schemes.

[BibT_eX]

[DOI]

Acta Cybern., 1987

1985

Atomic characterizations of uniform multi-pass attribute grammars.

[BibT_eX]

[DOI]

Acta Cybern., 1985

A multi-visti charaterization of absolutely noncircular attribute grammars.

[BibT_eX]

[DOI]

Acta Cybern., 1985

1984

On injective attributed characterization of 2-way deterministic finite state transducers.

[BibT_eX]

[DOI]

Acta Cybern., 1984

1983

Linear deterministic attributed transformations.

[BibT_eX]

[DOI]

Acta Cybern., 1983

1982

An algebraic definition of attributed transformations.

[BibT_eX]

[DOI]

Acta Cybern., 1982

1981

An Algebraic Defenition of Attributed Transformations.

[BibT_eX]

[DOI]