Fundamentals of Computation Theory
From MaRDI portal
Publication:5900814
DOI10.1007/b11926zbMath1278.68138MaRDI QIDQ5900814
Publication date: 20 April 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b11926
Related Items
Branching automata with costs -- a way of reflecting parallelism in costs, Schützenberger's theorem on formal power series follows from Kleene's theorem, A Kleene theorem for weighted tree automata over distributive multioperator monoids