Semirings, automata, languages
Semirings, automata, languages
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Completeness of Park induction
MFPS '94 Proceedings of the tenth conference on Mathematical foundations of programming semantics
Information and Computation
Communication and Concurrency
Definable Operation in General Algebras, and the Theory of Automata and Flowcharts
Programming Languages and Their Definition - Hans Bekic (1936-1982)
Complete Axioms for Categorical Fixed-Point Operators
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
An extension theorem with an application to formal tree series
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Rational algebraic theories and fixed-point solutions
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
Partial Conway and Iteration Semirings
Fundamenta Informaticae
Axiomatizing rational power series over natural numbers
Information and Computation
Iteration Grove Theories with Applications
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Hi-index | 0.00 |
Partial Conway theories are algebraic theories equipped with a partially defined dagger operation satisfying some natural identities. We prove a Kleene type theorem for partial Conway theories and discuss several applications of this result.