Zoltán Ésik

Proceedings of the Handbook of Automata Theory., 2021

2019

Equational properties of fixed-point operations in cartesian categories: An overview.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2019

On Free ω-Continuous and Regular Ordered Algebras.

[BibT_eX]

[DOI]

Dexter Kozen

Log. Methods Comput. Sci., 2019

2018

Two equational theories of partial words.

[BibT_eX]

[DOI]

Christian Choffrut

Theor. Comput. Sci., 2018

2017

Equational axioms associated with finite automata for fixed point operations in cartesian categories.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2017

An analysis of the equational properties of the well-founded fixed point.

[BibT_eX]

[DOI]

Arnaud Carayol

J. Log. Algebraic Methods Program., 2017

The Triple-Pair Construction for Weighted ω-Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Continuous Semiring-Semimodule Pairs and Mixed Algebraic Systems.

[BibT_eX]

[DOI]

Acta Cybern., 2017

An Algebraic Approach to Energy Problems II - The Algebra of Energy Functions.

[BibT_eX]

[DOI]

Acta Cybern., 2017

An Algebraic Approach to Energy Problems I - *-Continuous Kleene ω-Algebras.

[BibT_eX]

[DOI]

Acta Cybern., 2017

Commutative Positive Varieties of Languages.

[BibT_eX]

[DOI]

Jorge Almeida

Jean-Éric Pin

Acta Cybern., 2017

Solving Fixed Point Equations over Complete Semirings.

[BibT_eX]

[DOI]

Proceedings of the Role of Theory in Computer Science, 2017

2016

Some Remarks on Conway and Iteration Theories.

[BibT_eX]

[DOI]

Sergey Goncharov

CoRR, 2016

Ternary Equational Languages.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2016

MSO-definable Properties of Muller Context-Free Languages Are Decidable.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015

A fixed point theorem for non-monotonic functions.

[BibT_eX]

[DOI]

Panos Rondogiannis

Theor. Comput. Sci., 2015

Residuated Park theories.

[BibT_eX]

[DOI]

J. Log. Comput., 2015

*-Continuous Kleene ω-Algebras for Energy Problems.

[BibT_eX]

[DOI]

Uli Fahrenberg

Axel Legay

Proceedings of the Proceedings Tenth International Workshop on Fixed Points in Computer Science, 2015

Equational Axioms for Fixed Point Operations.

[BibT_eX]

[DOI]

CoRR, 2015

In Memory of Professor Ferenc Gécseg.

[BibT_eX]

[DOI]

Zoltán Fülöp

Acta Cybern., 2015

Equational Properties of Stratified Least Fixed Points (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, Information, and Computation, 2015

A Representation Theorem for Stratified Complete Lattices.

[BibT_eX]

[DOI]

Proceedings of the Logic, Language, and Computation, 2015

*-Continuous Kleene ω-Algebras.

[BibT_eX]

[DOI]

Uli Fahrenberg

Axel Legay

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

2014

Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation.

[BibT_eX]

[DOI]

Angelos Charalambidis

Panos Rondogiannis

Theory Pract. Log. Program., 2014

Axiomatizing weighted synchronization trees and weighted bisimilarity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

On the Structure of Free Iteration Semirings.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2014

Operational Characterization of Scattered MCFLs.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

Conway and iteration hemirings Part 2.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2014

Conway and iteration hemirings Part 1.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2014

Equational properties of saturated least fixed points.

[BibT_eX]

[DOI]

CoRR, 2014

Theorems on Pre-fixed Points of Non-Monotonic Functions with Applications in Logic Programming and Formal Grammars.

[BibT_eX]

[DOI]

Panos Rondogiannis

Proceedings of the Logic, Language, Information, and Computation, 2014

On Power Series over a Graded Monoid.

[BibT_eX]

[DOI]

Proceedings of the Computing with New Resources, 2014

2013

Free inductive K-semialgebras.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2013

The FC-rank of a context-free language.

[BibT_eX]

[DOI]

Arnaud Carayol

Inf. Process. Lett., 2013

On Context-Free Languages of Scattered Words.

[BibT_eX]

[DOI]

Satoshi Okawa

Int. J. Found. Comput. Sci., 2013

A Connection Between Concurrency and Language Theory.

[BibT_eX]

[DOI]

Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, 2013

Operational characterization of scattered MCFLs -- Technical Report

[BibT_eX]

[DOI]

CoRR, 2013

Conway and iteration hemirings.

[BibT_eX]

[DOI]

CoRR, 2013

Kleene Algebras and Semimodules for Energy Problems.

[BibT_eX]

[DOI]

Proceedings of the Automated Technology for Verification and Analysis, 2013

2012

On Müller context-free grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Ordinal Automata and Cantor Normal Form.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Hausdorff Rank of Scattered Context-Free Linear Orders.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2012: Theoretical Informatics, 2012

A Context-Free Linear Ordering with an Undecidable First-Order Theory.

[BibT_eX]

[DOI]

Arnaud Carayol

Proceedings of the Theoretical Computer Science, 2012

Algebraic Synchronization Trees and Processes.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011

Büchi context-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Dagger extension theorem.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2011

An undecidable property of context-free linear orders.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

The Category of Simulations for Weighted Tree Automata.

[BibT_eX]

[DOI]

Andreas Maletti

Int. J. Found. Comput. Sci., 2011

Algebraic Linear Orderings.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Stephen L. Bloom 1940-2010.

[BibT_eX]

[DOI]

Klaus Sutner

Fundam. Informaticae, 2011

Multi-Linear Iterative K-Σ-Semialgebras.

[BibT_eX]

[DOI]

Proceedings of the Twenty-seventh Conference on the Mathematical Foundations of Programming Semantics, 2011

Context-free ordinals

[BibT_eX]

[DOI]

CoRR, 2011

Multi-linear iterative K-Sigma-semialgebras

[BibT_eX]

[DOI]

CoRR, 2011

Scattered Context-Free Linear Orderings.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

A Unifying Kleene Theorem for Weighted Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Rainbow of Computer Science, 2011

Kleene Theorem in Partial Conway Theories with Applications.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Foundations in Computer Science, 2011

Partial Conway and Iteration Semiring-Semimodule Pairs.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Foundations in Computer Science, 2011

2010

Preface.

[BibT_eX]

[DOI]

Erzsébet Csuhaj-Varjú

Theor. Comput. Sci., 2010

A Mezei-Wright theorem for categorical algebras.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Axiomatizing the equational theory of regular tree languages.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2010

Algebraic Characterization of Logically Defined Tree Languages.

[BibT_eX]

[DOI]

Pascal Weil

Int. J. Algebra Comput., 2010

Algebraic Ordinals.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Representing Small Ordinals by Finite Automata

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

Free iterative and iteration K-semialgebras

[BibT_eX]

[DOI]

CoRR, 2010

An undecidable property of context-free languages

[BibT_eX]

[DOI]

CoRR, 2010

Simulations of Weighted Tree Automata.

[BibT_eX]

[DOI]

Andreas Maletti

Proceedings of the Implementation and Application of Automata, 2010

Simulation vs. Equivalence.

[BibT_eX]

Andreas Maletti

Proceedings of the 2010 International Conference on Foundations of Computer Science, 2010

2009

Estimation of state complexity of combined operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Axiomatizing rational power series over natural numbers.

[BibT_eX]

[DOI]

Inf. Comput., 2009

Context-Free Languages of Countable Words.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing, 2009

Scattered Algebraic Linear Orderings.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Fixed Points in Computer Science, 2009

Iteration Grove Theories with Applications.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Third International Conference, 2009

Cycle-Free Finite Automata in Partial Iterative Semirings.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008

Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Products of Tree Automata with an Application to Temporal Logic.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Partial Conway and Iteration Semirings.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Games for Temporal Logics on Trees.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Applications of Automata, 2008

Iteration Semirings.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007

A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

Boolean Fuzzy Sets.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Fuzzy tree automata.

[BibT_eX]

[DOI]

Guangwu Liu

Fuzzy Sets Syst., 2007

Axiomatizing rational power series

[BibT_eX]

[DOI]

CoRR, 2007

An Algebraic Characterization of Wolper's Logic.

[BibT_eX]

Gabriela Martín

Proceedings of the 2007 International Conference on Foundations of Computer Science, 2007

Regular and Algebraic Words and Ordinals.

[BibT_eX]

[DOI]

Proceedings of the Algebra and Coalgebra in Computer Science, 2007

Aperiodicity in Tree Automata.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics, Second International Conference, 2007

2006

Characterizing CTL-like logics on finite trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Preface.

[BibT_eX]

[DOI]

Alberto Bertoni

Juhani Karhumäki

Theor. Comput. Sci., 2006

Preface.

[BibT_eX]

[DOI]

Acta Cybern., 2006

Completing Categorical Algebras.

[BibT_eX]

[DOI]

Proceedings of the Fourth IFIP International Conference on Theoretical Computer Science (TCS 2006), 2006

2005

Algebraic recognizability of regular tree languages.

[BibT_eX]

[DOI]

Pascal Weil

Theor. Comput. Sci., 2005

Guest editors' foreword: Process Algebra.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A Semiring-Semimodule Generalization of ω-Regular Languages II.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

A Semiring-Semimodule Generalization of ω-Regular Languages I.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2005

Algebraic and graph-theoretic properties of infinite n-posets.

[BibT_eX]

[DOI]

Zoltán L. Németh

RAIRO Theor. Informatics Appl., 2005

The equational theory of regular words.

[BibT_eX]

[DOI]

Inf. Comput., 2005

Cascade Products and Temporal Logics on Finite Trees.

[BibT_eX]

[DOI]

Proceedings of the Workshop "Essays on Algebraic Process Calculi", 2005

Algebraically complete semirings and Greibach normal form.

[BibT_eX]

[DOI]

Hans Leiß

Ann. Pure Appl. Log., 2005

2004

Inductive star-semirings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Foreword.

[BibT_eX]

[DOI]

Zoltán Fülöp

Theor. Comput. Sci., 2004

Higher Dimensional Automata.

[BibT_eX]

[DOI]

Zoltán L. Németh

J. Autom. Lang. Comb., 2004

Foreword.

[BibT_eX]

[DOI]

Igor Walukiewicz

RAIRO Theor. Informatics Appl., 2004

Axiomatizing omega and omega-op powers of words.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2004

An Algebraic Generalization of omega-Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

A Semiring-Semimodule Generalization of omega-Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Theory Is Forever, 2004

2003

The max-plus algebra of the natural numbers has no finite equational basis.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Equational theories of tropical semirings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Formal Tree Series.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

An Extension Theorem with an Application to Formal Tree Series.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

Regular languages definable by Lindström quantifiers.

[BibT_eX]

[DOI]

Kim Guldstrand Larsen

RAIRO Theor. Informatics Appl., 2003

Foreword.

[BibT_eX]

RAIRO Theor. Informatics Appl., 2003

Deciding whether the frontier of a regular tree is scattered.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2003

Hazard Algebras.

[BibT_eX]

[DOI]

Janusz A. Brzozowski

Formal Methods Syst. Des., 2003

Temporal Logic with Cyclic Counting and the Degree of Aperiodicity of Finite Automata.

[BibT_eX]

[DOI]

Masami Ito

Acta Cybern., 2003

On Logically Defined Recognizable Tree Languages.

[BibT_eX]

[DOI]

Pascal Weil

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Axioms for Regular Words: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Axiomatizing the subsumption and subword preorders on finite and infinite partial words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Continuous Additive Algebras and Injective Simulations of Synchronization Trees.

[BibT_eX]

[DOI]

J. Log. Comput., 2002

Rationally Additive Semirings.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

A Fully Equational Proof of Parikh's Theorem.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2002

Unique, guarded fixed points in an additive setting: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Category Theory and Computer Science, 2002

Extended Temporal Logic on Finite Words and Wreath Product of Monoids with Distinguished Generators.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 6th International Conference, 2002

Greibach Normal Form in Algebraically Complete Semirings.

[BibT_eX]

[DOI]

Hans Leiß

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Equational Axioms for Probabilistic Bisimilarity.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 2002

2001

Homomorphic Simulation and Letichevsky's Criterion.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2001

On Equations for Union-Free Regular Languages.

[BibT_eX]

[DOI]

Sinisa Crvenkovic

Igor Dolinka

Inf. Comput., 2001

Iteration 2-theories.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2001

Algebras for Hazard Detection.

[BibT_eX]

[DOI]

Janusz A. Brzozowski

Y. Iland

Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic, 2001

Axiomatizing Tropical Semirings.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Software Science and Computation Structures, 2001

Automata on Series-Parallel Biposets.

[BibT_eX]

[DOI]

Zoltán L. Németh

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

The Equational Theory of Fixed Points with Applications to Generalized Language Theory.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

A Generation of Kozen's Axiomatization of the Equational Theory of the Regular Sets.

[BibT_eX]

Proceedings of the Words, Semigroups, and Transductions, 2001

2000

A proof of the Krohn-Rhodes Decomposition Theorem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

The Variety of Kleene Algebras with Conversion is not Finitely Based.

[BibT_eX]

[DOI]

Sinisa Crvenkovic

Igor Dolinka

Theor. Comput. Sci., 2000

A Kleene Theorem for Lindenmayerian Algebraic Power Series.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2000

The Power of the Group-Identities for Iteration.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2000

On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers.

[BibT_eX]

[DOI]

Proceedings of the STACS 2000, 2000

Iteration Theories of Boolean Functions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

Hazard Algebras (Extended Abstract).

[BibT_eX]

Janusz A. Brzozowski

Proceedings of the A Half-Century of Automata Theory: Celebration and Inspiration, 2000

Axiomatizing the Least Fixed Point Operation and Binary Supremum.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 2000

1999

A Note on Equations for Commutative Regular Languages.

[BibT_eX]

[DOI]

Sinisa Crvenkovic

Igor Dolinka

Inf. Process. Lett., 1999

Group Axioms for Iteration.

[BibT_eX]

[DOI]

Inf. Comput., 1999

Axiomatizing Iteration Categories.

[BibT_eX]

[DOI]

Acta Cybern., 1999

Series and Parallel Operations on Pomsets.

[BibT_eX]

[DOI]

Satoshi Okawa

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1999

1998

Equational Properties of Iteration in Algebraically Complete Categories.

[BibT_eX]

[DOI]

Anna Labella

Theor. Comput. Sci., 1998

Shuffle binoids.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1998

Semantics on Flowchart Programs and the Free Conway Theories.

[BibT_eX]

[DOI]

L. Bernátsky

RAIRO Theor. Informatics Appl., 1998

A Cayley Theorem for Ternary Algebras.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1998

Nonfinite Axiomatizability of the Equational Theory of Shuffle.

[BibT_eX]

[DOI]

Michael Bertol

Acta Informatica, 1998

Axiomatizing the Equational Theory of Regular Tree Languages (Extended Anstract).

[BibT_eX]

[DOI]

Proceedings of the STACS 98, 1998

1997

Completeness of Park Induction.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

The Equational Logic of Fixed Points (Tutorial).

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

Varieties Generated by Languages with Poset Operations.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1997

Axiomatizing Shuffle and Concatenation in Languages.

[BibT_eX]

[DOI]

Inf. Comput., 1997

Iteration 2-Theories: Extended Abstract.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1997

1996

Free Shuffle Algebras in Language Varieties.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Fixed-Point Operations on ccc's. Part I.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

Two Axiomatizations of a Star Semiring Quasi-Variety.

[BibT_eX]

Bull. EATCS, 1996

1995

Equational Properties of Kleene Algebras of Relations with Conversion.

[BibT_eX]

[DOI]

L. Bernátsky

Theor. Comput. Sci., 1995

Some Equational Laws of Initiality in 2CCC's.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1995

Scott induction and equational proofs.

[BibT_eX]

[DOI]

L. Bernátsky

Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

Nonfinite Axiomatizability of Shuffle Inequalities.

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

Free Shuffle Algebras in Language Varieties (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the LATIN '95: Theoretical Informatics, 1995

1994

Solving Polynomial Fixed Point Equations.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1993

Iteration Theories - The Equational Logic of Iterative Processes

[BibT_eX]

[DOI]

EATCS Monographs on Theoretical Computer Science, Springer, ISBN: 0387563784, 1993

Equational Axioms for Regular Sets.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 1993

Matrix and Matricial Iteration Theories, Part II.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

Matrix and Matricial Iteration Theories, Part I.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1993

Erratum: Iteration Algebras.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1993

Some Quasi-Varieties of Iteration Theories.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992

Iteration Algebras.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 1992

1991

Results on Homomorphic Realization of Automata by alpha_0-Products.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

Floyd-Hoare Logic in Iteration Theories.

[BibT_eX]

[DOI]

J. ACM, 1991

Cayley iff Stone.

[BibT_eX]

Bull. EATCS, 1991

A note on isomorphic simulation of automata by networks of two-state automata.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Iteration Algebras (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the TAPSOFT'91: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1991

Program Correctness and Matricial Iteration Theories.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Programming Semantics, 1991

1990

Iteration theories of synchronization trees

[BibT_eX]

[DOI]

Dirk Taubner

Forschungsberichte, TU Munich, 1990

A note on the axiomatization of iteration theories.

[BibT_eX]

[DOI]

Acta Cybern., 1990

Product hierarchies of automata and homomorphic simulation.

[BibT_eX]

[DOI]

Acta Cybern., 1990

1989

Equational Logic of Circular Data Type Specification.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1989

On Product Hierarchies of Automata.

[BibT_eX]

[DOI]

Balázs Imreh

Proceedings of the Fundamentals of Computation Theory, 1989

1988

Critical Classes for the alpha_0-Product.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Varieties of Iteration Theories.

[BibT_eX]

[DOI]

SIAM J. Comput., 1988

Independence of the Equational Axioms for Iteration Theories.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1988

On homomorphic simulation of automata by α0-products.

[BibT_eX]

[DOI]

Acta Cybern., 1988

On the hierarchy of νi-product.

[BibT_eX]

[DOI]

Acta Cybern., 1988

An Extension of the Krohn-Rhodes Decomposition of Automata.

[BibT_eX]

[DOI]

Proceedings of the Machines, 1988

1987

On a Representation of Tree Automata.

[BibT_eX]

[DOI]

Ferenc Gécseg

Theor. Comput. Sci., 1987

A note on α0* - products of aperiodic automata.

[BibT_eX]

[DOI]

J. Virágh

Acta Cybern., 1987

On isomorphic realization of automata with α0-products.

[BibT_eX]

[DOI]

Acta Cybern., 1987

Loop products and loop-free products.

[BibT_eX]

[DOI]

Acta Cybern., 1987

1986

On alpha-0-Products and alpha-2-Products.

[BibT_eX]

[DOI]

Ferenc Gécseg

Theor. Comput. Sci., 1986

Complete Classes of Automata for the alpha-0-Product.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

On products of automata with identity.

[BibT_eX]

[DOI]

J. Virágh

Acta Cybern., 1986

Varieties and general products of top-down algebras.

[BibT_eX]

[DOI]

Acta Cybern., 1986

Homomorphic Realizations of Automata with Compositions.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1985

Axiomatizing Schemes and Their Behaviors.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1985

On the weak equivalence of Elgot's flow-chart schemata.

[BibT_eX]

[DOI]

Acta Cybern., 1985

1984

Some varieties of iteration theories.

[BibT_eX]

Bull. EATCS, 1984

1983

Algebras of Iteration Theories.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1983

General products and equational classes of automata.

[BibT_eX]

[DOI]

Ferenc Gécseg

Acta Cybern., 1983

Decidability results concerning tree transducers II.

[BibT_eX]

[DOI]

Acta Cybern., 1983

1981

Subdirectly irreducible commutative automata.

[BibT_eX]

[DOI]

Balázs Imreh

Acta Cybern., 1981

Remarks on finite commutative automata.

[BibT_eX]

[DOI]

Balázs Imreh

Acta Cybern., 1981

An Axiomatization of Regular Forests in the Language of Algebraic Theories with Iteration.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Decidability results concerning tree transducers I.

[BibT_eX]

[DOI]

Acta Cybern., 1980

1979

On functional tree transducers.

[BibT_eX]

Proceedings of the Fundamentals of Computation Theory, 1979

1976

On two problems of A. Salomaa.

[BibT_eX]

[DOI]