Abstract
We introduce weighted automata over infinite words with Muller acceptance condition and we show that their behaviors coincide with the semantics of weighted restricted MSO-sentences. Furthermore, we establish an equivalence property of weighted Muller and weighted Büchi automata over certain semirings.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arnold, A.: Finite transition systems. International Series in Computer Science. Prentice Hall, Englewood Cliffs (1994)
Balbes, R., Dwinger, P.: Distributive Lattices. University of Missouri Press (1974)
Berstel, J., Reutenauer, C.: Rational Series and Their Languages. EATCS Monographs in Theoretical Computer Science, vol. 12. Springer, Heidelberg (1988)
Bloom, S.L., Ésik, Z.: Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1993)
Büchi, J.R.: Weak second-order arithmetic and finite automata. Z. Math. Logik Grundlager Math. 6, 66–92 (1960)
Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. 1960 Int. Congr. for Logic, Methodology and Philosophy of Science, pp. 1–11 (1962)
Culik II, K., Kari, J.: Image compression using weighted finite automata. Computer and Graphics 17, 305–313 (1993)
Culik, K., Karhumäki, J.: Finite automata computing real functions. SIAM J. Comput. 23(4), 789–814 (1994)
Droste, M., Gastin, P.: On aperiodic and star-free formal power series in partially commuting variables. In: Proceedings of FPASAC 2000, pp. 158–169. Springer, Heidelberg (2000), full version: Research Report LSV-05, ENS de Cachan, France (2005)
Droste, M., Gastin, P.: Weighted automata and weighted logics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 513–525. Springer, Heidelberg (2005); full version in:, http://www.informatik.uni-leipzig.de/theo/pers/droste/publications.html
Droste, M., Kuske, D.: Skew and infinitary formal power series. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 426–438. Springer, Heidelberg (2003)
Droste, M., Püschmann, U.: Weighted Büchi Automata (submitted)
Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, London (1974)
Elgot, C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21–52 (1961)
Ésik, Z., Kuich, W.: On iteration semiring-semimodule pairs (to appear)
Ésik, Z., Kuich, W.: A semiring-semimodule generalization of ω-regular languages I and II. Special issue on Weighted automata. Droste, M., Vogler, H. (eds.) J. of Automata Languages and Combinatorics (to appear)
Hafner, U.: Low Bit-Rate Image and Video Coding with Weighted Finite Automata. PhD thesis, Universität Würzburg, Germany (1999)
Jiang, Z., Litow, B., de Vel, O.: Similarity enrichment in image compression through weighted finite automata. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 447–456. Springer, Heidelberg (2000)
Katritzke, F.: Refinements of data compression using weighted finite automata. PhD thesis, Universität Siegen, Germany (2001)
Krithivasan, K., Sharda, K.: Fuzzy ω-automata. Inf. Sci. 138, 257–281 (2001)
Kuich, W.: Semirings and formal power series: Their relevance to formal languages and automata theory. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 609–677. Springer, Heidelberg (1997)
Kuich, W.: On skew formal power series. In: Bozapalidis, S., Kalampakas, A., Rahonis, G. (eds.) Proceedings of the Conference on Algebraic Informatics. Thessaloniki, pp. 7–30 (2005)
Kuich, W., Rahonis, G.: Fuzzy regular languages over finite and infinite words. Fuzzy Sets and Systems (to appear)
Kuich, W., Salomaa, A.: Semirings, Automata, Languages. EATCS Monographs in Theoretical Computer Science, vol. 5. Springer, Heidelberg (1986)
Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes. Princeton Series in Computer Science. Princeton University Press, Princeton (1994)
McMillan, K.: Symbolic Model Checking. Kluwer Academic Publishers, Dordrecht (1993)
Mohri, M.: Finite-state transducers in language and speech processing. Computational Linguistics 23, 269–311 (1997)
Mohri, M., Pereira, F., Riley, M.: The design principles of a weighted finite-state transducer library. Theoret. Comput. Sci. 231, 17–32 (2000)
Perrin, D., Pin, J.E.: Infinite Words. Elsevier, Amsterdam (2004)
Rahonis, G.: Infinite fuzzy computations. Fuzzy Sets and Systems 153, 275–288 (2005)
Salomaa, A., Soittola, M.: Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer, Heidelberg (1978)
Schützenberger, M.: On the definition of a family of automata. Inf. Control 4, 245–270 (1961)
Thomas, W.: Automata on infinite objects. In: Leeuwen, J.v. (ed.) Handbook of Theoretical Computer Science, vol. B, pp. 135–191. Elsevier Science Publishers, Amsterdam (1990)
Thomas, W.: Languages, automata and logic. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 389–485. Springer, Heidelberg (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Droste, M., Rahonis, G. (2006). Weighted Automata and Weighted Logics on Infinite Words. In: Ibarra, O.H., Dang, Z. (eds) Developments in Language Theory. DLT 2006. Lecture Notes in Computer Science, vol 4036. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779148_6
Download citation
DOI: https://doi.org/10.1007/11779148_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35428-4
Online ISBN: 978-3-540-35430-7
eBook Packages: Computer ScienceComputer Science (R0)