Werner Kuich

According to our database1, Werner Kuich
  • authored at least 87 papers between 1966 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
The Triple-Pair Construction for Weighted ω-Pushdown Automata.
Proceedings of the Proceedings 15th International Conference on Automata and Formal Languages, 2017

Weigthed omega-Restricted One Counter Automata.
CoRR, 2017

Continuous Semiring-Semimodule Pairs and Mixed Algebraic Systems.
Acta Cybern., 2017

A Kleene Theorem for Weighted ω-Pushdown Automata.
Acta Cybern., 2017

Solving Fixed Point Equations over Complete Semirings.
Proceedings of the Role of Theory in Computer Science, 2017

2016
Zoltán Ésik (1951 - 2016) - In Memoriam.
Journal of Automata, Languages and Combinatorics, 2016

2015
Why We Need Semirings in Automata Theory (Extended Abstract).
Proceedings of the Algebraic Informatics - 6th International Conference, 2015

2014
Conway and iteration hemirings Part 2.
IJAC, 2014

Conway and iteration hemirings Part 1.
IJAC, 2014

On Power Series over a Graded Monoid.
Proceedings of the Computing with New Resources, 2014

2013
Weighted finite automata over hemirings.
Theor. Comput. Sci., 2013

Free inductive K-semialgebras.
J. Log. Algebr. Program., 2013

Conway and iteration hemirings.
CoRR, 2013

2011
Algebraic Systems and Pushdown Automata.
Proceedings of the Algebraic Foundations in Computer Science, 2011

A Unifying Kleene Theorem for Weighted Finite Automata.
Proceedings of the Rainbow of Computer Science, 2011

2010
Free inductive K-semialgebras
CoRR, 2010

Free iterative and iteration K-semialgebras
CoRR, 2010

2009
Cycle-Free Finite Automata in Partial Iterative Semirings.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008
Multi-Valued MSO Logics OverWords and Trees.
Fundam. Inform., 2008

Partial Conway and Iteration Semirings.
Fundam. Inform., 2008

2007
A Semiring-Semimodule Generalization of Transducers and Abstract omega-Families of Power Series.
Journal of Automata, Languages and Combinatorics, 2007

Boolean Fuzzy Sets.
Int. J. Found. Comput. Sci., 2007

Partial Conway and iteration semirings
CoRR, 2007

2006
Fuzzy regular languages over finite and infinite words.
Fuzzy Sets and Systems, 2006

Kleene Theorems for skew formal power series.
Acta Cybern., 2006

2005
A Semiring-Semimodule Generalization of ?-Regular Languages II.
Journal of Automata, Languages and Combinatorics, 2005

A Semiring-Semimodule Generalization of ?-Regular Languages I.
Journal of Automata, Languages and Combinatorics, 2005

2004
Inductive star-semirings.
Theor. Comput. Sci., 2004

An Algebraic Generalization of omega-Regular Languages.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

A Semiring-Semimodule Generalization of omega-Context-Free Languages.
Proceedings of the Theory Is Forever, 2004

2003
Formal Tree Series.
Journal of Automata, Languages and Combinatorics, 2003

On the Exponentiation of Languages.
Proceedings of the Fundamentals of Computation Theory, 14th International Symposium, 2003

2002
Heyting Algebras and Formal Languages.
J. UCS, 2002

Rationally Additive Semirings.
J. UCS, 2002

Formal series over sorted algebras.
Discrete Mathematics, 2002

2001
Atoms and partial orders of infinite languages.
ITA, 2001

Pushdown Tree Automata, Algebraic Tree Systems, and Algebraic Tree Series.
Inf. Comput., 2001

Cones, Semi-AFPs, and AFPs of Algebraic Power Series.
Proceedings of the Fundamentals of Computation Theory, 13th International Symposium, 2001

Regularly controlled formal power series.
Proceedings of the Where Mathematics, 2001

A Generation of Kozen's Axiomatization of the Equational Theory of the Regular Sets.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
A Kleene Theorem for Lindenmayerian Algebraic Power Series.
Journal of Automata, Languages and Combinatorics, 2000

Formal Series over Algebras.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

Forty Years of Formal Power Series in Automata Theory.
Proceedings of the A Half-Century of Automata Theory: Celebration and Inspiration, 2000

1999
Tree Transducers and Formal Tree Series.
Acta Cybern., 1999

Full Abstract Families of Tree Series I.
Proceedings of the Jewels are Forever, 1999

1998
Gaußian Elimination and a Characterization of Algebraic Power Series.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
On Lindenmayerian Algebraic Power Series.
Theor. Comput. Sci., 1997

A Characterization of Abstract Families of Algebraic Power Series.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997

Formal Power Series over Trees.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Semirings: A basis for a mathematical automata and language theory.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Generalized Lindenmayerian Algebraic Systems.
Proceedings of the New Trends in Formal Languages, 1997

On Abstract Families of Languages, Power Series, and Elements.
Proceedings of the Foundations of Computer Science: Potential - Theory, 1997

1996
On a Power Series Generalization of ETOL Languages.
Fundam. Inform., 1996

1995
On Four Classes of Lindenmayerian Power Series.
J. UCS, 1995

Representations and Complete Semiring Morphisms.
Inf. Process. Lett., 1995

The Algebraic Equivalent of AFL Theory.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
On the Multiplicity Equivalence Problem for Context-free Grammars.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
Lindenmayer Systems Generalized to Formal Power Series and Their Growth Functions.
Proceedings of the Developments in Language Theory, 1993

1991
Automata and Languages Generalized to omega-Continuous Semirings.
Theor. Comput. Sci., 1991

1990
Omega-Continuous Semirings, Algebraich Systems and Pushdown Automata.
Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1988
Matrix Systems and Principal Cones of Algebraic Power Series.
Theor. Comput. Sci., 1988

1987
Hauptkegel algebraischer Potenzreihen.
Elektronische Informationsverarbeitung und Kybernetik, 1987

Unampiguous automata.
Bulletin of the EATCS, 1987

The Kleene and the Parikh Theorem in Complete Semirings.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
Matrix Systems and Principal Cones of Algebraic Power Series.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

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

1984
Semitopological Semirings and Pushdown Automata.
Mathematical Systems Theory, 1984

1983
Infinite Linear Systems and one Counter Languages.
Theor. Comput. Sci., 1983

1982
An Algebraic Characterization of Some Principal Regulated Rational Cones.
J. Comput. Syst. Sci., 1982

1981
The Characterization of Nonexpansive Grammars by Rational Power Series
Information and Control, February, 1981

Zur Theorie algebraischer Systeme.
Elektronische Informationsverarbeitung und Kybernetik, 1981

The Characterization of Parallel Ultralinear Grammars by Rational Power Series.
Acta Inf., 1981

Cycle-Free N-Algebraic Systems.
Proceedings of the Theoretical Computer Science, 1981

1980
Generating Functions for Derivation Trees
Information and Control, May, 1980

1979
On the Height of Derivation Trees.
Proceedings of the Automata, 1979

1976
The Structure Generating Function of Some Families of Languages
Information and Control, September, 1976

1973
Buchbesprechungen.
Computing, 1973

Buchbesprechung.
Computing, 1973

1972
Buchbesprechung.
Computing, 1972

1971
The Complexity of Skewlinear Tuple Languages and o-Regular Languages
Information and Control, November, 1971

The Structure Generating Function and Entropy of Tuple Languages
Information and Control, October, 1971

Buchbesprechungen.
Computing, 1971

On the inherent ambiguity of simple tuple languages.
Computing, 1971

Buchbesprechungen.
Computing, 1971

1970
On the Entropy of Context-Free Languages
Information and Control, April, 1970

Systems of Pushdown Acceptors and Context-free Grammars.
Elektronische Informationsverarbeitung und Kybernetik, 1970

1966
Block-stochastic matrices and associated finite-state languages.
Computing, 1966


  Loading...