Werner Kuich

Inf. Comput., 2022

Logic for ω-pushdown automata.

[BibT_eX]

[DOI]

Inf. Comput., 2022

2020

Greibach Normal Form for ω-Algebraic Systems and Weighted Simple ω-Pushdown Automata.

[BibT_eX]

[DOI]

CoRR, 2020

Nivat-Theorem and Logic for Weighted Pushdown Automata on Infinite Words.

[BibT_eX]

[DOI]

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

Weighted simple reset pushdown automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

Weighted omega-Restricted One Counter Automata.

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2018

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

Weigthed omega-Restricted One Counter Automata.

[BibT_eX]

[DOI]

CoRR, 2017

Continuous Semiring-Semimodule Pairs and Mixed Algebraic Systems.

[BibT_eX]

[DOI]

Acta Cybern., 2017

A Kleene Theorem for Weighted ω-Pushdown Automata.

[BibT_eX]

[DOI]

Acta Cybern., 2017

Solving Fixed Point Equations over Complete Semirings.

[BibT_eX]

[DOI]

Proceedings of the Role of Theory in Computer Science, 2017

2016

Zoltán Ésik (1951 - 2016) - In Memoriam.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2016

2015

Why We Need Semirings in Automata Theory (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 6th International Conference, 2015

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

On Power Series over a Graded Monoid.

[BibT_eX]

[DOI]

Proceedings of the Computing with New Resources, 2014

2013

Weighted finite automata over hemirings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Free inductive K-semialgebras.

[BibT_eX]

[DOI]

J. Log. Algebraic Methods Program., 2013

Conway and iteration hemirings.

[BibT_eX]

[DOI]

CoRR, 2013

2011

Algebraic Systems and Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Foundations in Computer Science, 2011

A Unifying Kleene Theorem for Weighted Finite Automata.

[BibT_eX]

[DOI]

Proceedings of the Rainbow of Computer Science, 2011

2010

Free iterative and iteration K-semialgebras

[BibT_eX]

[DOI]

CoRR, 2010

2009

Cycle-Free Finite Automata in Partial Iterative Semirings.

[BibT_eX]

[DOI]

Stephen L. Bloom

Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008

Multi-Valued MSO Logics OverWords and Trees.

[BibT_eX]

[DOI]

George Rahonis

Fundam. Informaticae, 2008

Partial Conway and Iteration Semirings.

[BibT_eX]

[DOI]

Stephen L. Bloom

Fundam. Informaticae, 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

2006

Fuzzy regular languages over finite and infinite words.

[BibT_eX]

[DOI]

George Rahonis

Fuzzy Sets Syst., 2006

Kleene Theorems for skew formal power series.

[BibT_eX]

[DOI]

Acta Cybern., 2006

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

2004

Inductive star-semirings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

Formal Tree Series.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2003

On the Exponentiation of Languages.

[BibT_eX]

[DOI]

Klaus W. Wagner

Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002

Heyting Algebras and Formal Languages.

[BibT_eX]

[DOI]

Norbert Sauer

Friedrich J. Urbanek

J. Univers. Comput. Sci., 2002

Rationally Additive Semirings.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

Formal series over sorted algebras.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Atoms and partial orders of infinite languages.

[BibT_eX]

[DOI]

Norbert Sauer

RAIRO Theor. Informatics Appl., 2001

Pushdown Tree Automata, Algebraic Tree Systems, and Algebraic Tree Series.

[BibT_eX]

[DOI]

Inf. Comput., 2001

Cones, Semi-AFPs, and AFPs of Algebraic Power Series.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Regularly controlled formal power series.

[BibT_eX]

Henning Fernau

Proceedings of the Where Mathematics, 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 Kleene Theorem for Lindenmayerian Algebraic Power Series.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2000

Formal Series over Algebras.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Forty Years of Formal Power Series in Automata Theory.

[BibT_eX]

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

1999

Tree Transducers and Formal Tree Series.

[BibT_eX]

[DOI]

Acta Cybern., 1999

Full Abstract Families of Tree Series I.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

Gaußian Elimination and a Characterization of Algebraic Power Series.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997

Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

On Lindenmayerian Algebraic Power Series.

[BibT_eX]

[DOI]

Juha Honkala

Theor. Comput. Sci., 1997

A Characterization of Abstract Families of Algebraic Power Series.

[BibT_eX]

[DOI]

Georg Karner

Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Formal Power Series over Trees.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Semirings: A basis for a mathematical automata and language theory.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Generalized Lindenmayerian Algebraic Systems.

[BibT_eX]

[DOI]

Proceedings of the New Trends in Formal Languages, 1997

On Abstract Families of Languages, Power Series, and Elements.

[BibT_eX]

[DOI]

Georg Karner

Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996

On a Power Series Generalization of ETOL Languages.

[BibT_eX]

[DOI]

Juha Honkala

Fundam. Informaticae, 1996

1995

On Four Classes of Lindenmayerian Power Series.

[BibT_eX]

[DOI]

Juha Honkala

J. Univers. Comput. Sci., 1995

Representations and Complete Semiring Morphisms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

The Algebraic Equivalent of AFL Theory.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994

On the Multiplicity Equivalence Problem for Context-free Grammars.

[BibT_eX]

[DOI]

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993

Lindenmayer Systems Generalized to Formal Power Series and Their Growth Functions.

[BibT_eX]

Proceedings of the Developments in Language Theory, 1993

1991

Automata and Languages Generalized to omega-Continuous Semirings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

1990

Omega-Continuous Semirings, Algebraich Systems and Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1988

Matrix Systems and Principal Cones of Algebraic Power Series.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

1987

Hauptkegel algebraischer Potenzreihen.

[BibT_eX]

J. Inf. Process. Cybern., 1987

Unampiguous automata.

[BibT_eX]

Bull. EATCS, 1987

The Kleene and the Parikh Theorem in Complete Semirings.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

Semirings, Automata, Languages

[BibT_eX]

[DOI]

Arto Salomaa

EATCS Monographs on Theoretical Computer Science 5, Springer, ISBN: 978-3-642-69959-7, 1986

1984

Semitopological Semirings and Pushdown Automata.

[BibT_eX]

[DOI]

W. Herfort

Math. Syst. Theory, 1984

1983

Infinite Linear Systems and one Counter Languages.

[BibT_eX]

[DOI]

Friedrich J. Urbanek

Theor. Comput. Sci., 1983

1982

An Algebraic Characterization of Some Principal Regulated Rational Cones.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

1981

The Characterization of Nonexpansive Grammars by Rational Power Series

[BibT_eX]

[DOI]

Gerd Baron

Inf. Control., February, 1981

Zur Theorie algebraischer Systeme.

[BibT_eX]

J. Inf. Process. Cybern., 1981

The Characterization of Parallel Ultralinear Grammars by Rational Power Series.

[BibT_eX]

[DOI]

Acta Informatica, 1981

Cycle-Free N-Algebraic Systems.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 1981

1980

Generating Functions for Derivation Trees

[BibT_eX]

[DOI]

Inf. Control., May, 1980

1979

On the Height of Derivation Trees.

[BibT_eX]

[DOI]

Helmut Prodinger

Friedrich J. Urbanek

Proceedings of the Automata, 1979

1976

The Structure Generating Function of Some Families of Languages

[BibT_eX]

[DOI]

R. K. Shyamasundar

Inf. Control., September, 1976

1973

Buchbesprechungen.

[BibT_eX]

[DOI]

Computing, 1973

Buchbesprechung.

[BibT_eX]

[DOI]

Viktor Scheiber

P. Meissl

Computing, 1973

1972

Buchbesprechung.

[BibT_eX]

[DOI]

Computing, 1972

1971

The Complexity of Skewlinear Tuple Languages and o-Regular Languages

[BibT_eX]

[DOI]

Inf. Control., November, 1971

The Structure Generating Function and Entropy of Tuple Languages

[BibT_eX]

[DOI]

Hermann A. Maurer

Inf. Control., October, 1971

Buchbesprechungen.

[BibT_eX]

[DOI]

Computing, 1971

On the inherent ambiguity of simple tuple languages.

[BibT_eX]

[DOI]

Hermann A. Maurer

Computing, 1971

Buchbesprechungen.

[BibT_eX]

[DOI]

Computing, 1971

1970

On the Entropy of Context-Free Languages

[BibT_eX]

[DOI]

Inf. Control., April, 1970

Systems of Pushdown Acceptors and Context-free Grammars.

[BibT_eX]

J. Inf. Process. Cybern., 1970

1966

Block-stochastic matrices and associated finite-state languages.

[BibT_eX]

[DOI]