B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun, Pebble Weighted Automata and Transitive Closure Logics, Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP'10) ? Part II, pp.587-598, 2010.
DOI : 10.1007/978-3-642-14162-1_49
URL : https://hal.archives-ouvertes.fr/hal-00608179

P. Gastin and B. Monmege, Adding Pebbles to Weighted Automata, Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), pp.28-51, 2012.
DOI : 10.1007/978-3-642-31606-7_4
URL : https://hal.archives-ouvertes.fr/hal-00776603

B. Bollig, P. Gastin, B. Monmege, and M. Zeitoun, A Probabilistic Kleene Theorem, Proceedings of the 10th International Symposium on Automated Technology for Verification and Analysis (ATVA'12), Lecture Notes in Computer Science, pp.400-415, 2012.
DOI : 10.1007/978-3-642-33386-6_31
URL : https://hal.archives-ouvertes.fr/hal-00909042

B. Bollig, P. Gastin, and B. Monmege, Weighted Specifications over Nested Words, Proceedings of the 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), pp.385-400, 2013.
DOI : 10.1007/978-3-642-37075-5_25
URL : https://hal.archives-ouvertes.fr/hal-00909035

[. Bibliography, P. Areces, M. Blackburn, and . Marx, The Computational Complexity of Hybrid Temporal Logics, Logic Journal of IGPL, vol.8, issue.5, pp.653-679, 2000.

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

R. Alur, L. D. Antoni, J. V. Deshmukh, M. Ragothaman, and Y. Yuan, Regular Functions and Cost Register Automata, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013.
DOI : 10.1109/LICS.2013.65
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.203

O. Almagor and . Kupferman, Max and Sum Semantics for Alternating Weighted Automata, Automated Technology for Verification and Analysis (ATVA'11), 2011.
DOI : 10.1007/978-3-642-24372-1_2

M. Allauzen and . Mohri, A Unified Construction of the Glushkov, Follow, and Antimirov Automata, Proceedings of the 31st international conference on Mathematical Foundations of Computer Science (MFCS'06), pp.110-121, 2006.
DOI : 10.1007/11821069_10

M. Anselmo, Two-way automata with multiplicity, Proceedings of the 17th International Colloquium on Automata, Languages and Programming (ICALP'90), pp.88-102
DOI : 10.1007/BFb0032024

V. Alfred, J. D. Aho, and . Ullman, The Theory of Parsing, Translation, and Compiling, 1972.

M. Blum and C. Hewitt, Automata on a 2-dimensional tape, 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), 1967.
DOI : 10.1109/FOCS.1967.6

A. Brüggeman-klein, Regular expressions into finite automata, Theoretical Computer Science, vol.120, issue.2, pp.197-213, 1993.
DOI : 10.1016/0304-3975(93)90287-4

P. Buchholz and P. Kemper, Quantifying the Dynamic Behavior of Process Algebras, Process Algebra and Probabilistic Methods. Performance Modelling and Verification, pp.184-199, 2001.
DOI : 10.1007/3-540-44804-7_12

J. Baier and . Katoen, Principles of Model Checking, 2008.

A. Brüggeman-klein and D. Wood, Caterpillars: a context specification technique, Markup Languages: Theory and Practice, vol.2, issue.1, pp.81-106, 2000.
DOI : 10.1162/109966200750410613

A. John, E. J. Brzozowski, and . Mccluskey, Signal Flow Graph Techniques for Sequential Circuit State Diagrams, IEEE Transactions on Electronic Computers, vol.12, issue.9, pp.67-76, 1963.

A. Bertoni, G. Mauri, and M. Torelli, Some Recursive Unsolvable Problems Relating to Isolated Cutpoints in Probabilistic Automata, Proceedings of the Fourth Colloquium on Automata, Languages and Programming, pp.87-94, 1977.

[. Boja?czyk, Forest Expressions, Computer Science Logic: 21st International Workshop (CSL'07), 2007.
DOI : 10.1007/978-3-540-74915-8_14

[. Boja?czyk, Tree-Walking Automata, Language and Automata Theory and Applications (LATA'08), 2008.
DOI : 10.1007/978-3-540-88282-4_1

[. Bourbaki, Algèbre commutative, 1964.

. Bpx-+-07-]-t, A. C. Brants, P. Popat, F. J. Xu, J. Och et al., Large Language Models in Machine Translation, Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), pp.858-867, 2007.

J. Berstel and C. Reutenauer, Noncommutative Rational Series With Applications, 2010.
DOI : 10.1017/CBO9780511760860
URL : https://hal.archives-ouvertes.fr/hal-00620617

[. Berry and R. Sethi, From regular expressions to deterministic automata, Theoretical Computer Science, vol.48, pp.117-126, 1986.
DOI : 10.1016/0304-3975(86)90088-5
URL : https://hal.archives-ouvertes.fr/inria-00075904

L. Bozzelli and C. Sánchez, Visibly rational expressions, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'12) Schloss Dagstuhl -Leibniz-Zentrum für Informatik, pp.211-223, 2012.
DOI : 10.1007/s00236-013-0190-6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.1310

[. Boja?czyk, M. Samuelides, T. Schwentick, and L. Segoufin, Expressive Power of Pebble Automata, Proceedings of the 33rd international conference on Automata, Languages and Programming -Volume Part I (ICALP'06), pp.157-168, 2006.
DOI : 10.1007/11786986_15

]. J. Büc59 and . Büchi, Weak Second-Order Arithmetic and Finite Automata, 1959.

L. Budach, Automata and Labyrinths, Mathematische Nachrichten, vol.7, issue.4, pp.195-282, 1978.
DOI : 10.1002/mana.19780860120

A. Charkrabarti, K. Chatterjee, T. A. Henzinger, O. Kupferman, and R. Majumdar, Verifying Quantitative Properties Using Bound Functions, Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods (CHARME'05), pp.50-64, 2005.
DOI : 10.1007/11560548_7

L. Krishnendu-chatterjee, H. Doyen, T. A. Edelsbrunner, P. Henzinger, and . Rannou, Mean-Payoff Automaton Expressions, Proceedings of the 21st international conference on Concurrency theory (CON- CUR'10), pp.269-283
DOI : 10.1007/978-3-642-15375-4_19

[. Chatterjee, L. Doyen, and T. A. Henzinger, Quantitative Languages, Proceedings of the 22nd International Workshop: Computer Science Logic, pp.385-400, 2008.
DOI : 10.1007/978-3-540-87531-4_28
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.9296

[. Chatterjee, L. Doyen, and T. A. Henzinger, Alternating Weighted Automata, Proceedings of the 17th International Conference on Fundamentals of computation theory (FCT'09), pp.3-13, 2009.
DOI : 10.1007/978-3-642-03409-1_2

[. Courcelle and J. Engelfriet, Graph Structure and Monadic-Second- Order Logic, a Language Theoretic Approach, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00646514

P. Caron and M. Flouret, From Glushkov WFAs to Rational Expressions, Proceedings of the 7th International Conference on Developments in Language Theory (DLT'03), volume 2710 of Lecture Notes in Computer Science, pp.183-193, 2003.
DOI : 10.1007/3-540-45007-6_14

[. Cortes, M. Mohri, and A. Rastogi, On the Computation of Some Standard Distances Between Probabilistic Automata, Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06), pp.137-149, 2006.
DOI : 10.1007/11812128_14

[. Colcombet, The Theory of Stabilisation Monoids and Regular Cost Functions, Proceedings of the 36th Internatilonal Colloquium on Automata, Languages and Programming: Part II (ICALP'09), number 5556 in Lecture Notes in Computer Science, pp.139-150, 2009.
DOI : 10.1007/978-3-642-02930-1_12
URL : https://hal.archives-ouvertes.fr/hal-00439259

J. Horton and C. , Regular Algebra and Finite Machines, 1971.

[. Cyriac, Temporal Logics for Concurrent Recursive Programs. Master's thesis, Master Parisien de Recherche en Informatique, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00591139

M. Droste and P. Gastin, Weighted automata and weighted logics, Theoretical Computer Science, vol.380, issue.1-2, pp.69-86, 2007.
DOI : 10.1016/j.tcs.2007.02.055
URL : https://hal.archives-ouvertes.fr/hal-00772642

M. Droste and P. Gastin, Weighted Automata and Weighted Logics, Handbook of Weighted Automata, pp.175-211, 2009.
DOI : 10.1016/j.tcs.2007.02.055
URL : https://hal.archives-ouvertes.fr/hal-00772642

M. Droste and W. Kuich, Semirings and Formal Power Series, Handbook of Weighted Automata, pp.3-27, 2009.
DOI : 10.1007/978-3-642-01492-5_1

[. Droste, W. Kuich, and H. Vogler, Handbook of Weighted Automata, EATCS Monographs in Theoretical Computer Science, 2009.
DOI : 10.1007/978-3-642-01492-5

S. Demri and R. Lazi?, LTL with the Freeze Quantifier and Register Automata, Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06), pp.17-26, 2006.

M. Droste and I. Meinecke, Describing Average- and Longtime-Behavior by Weighted MSO Logics, Proceedings of the 35th International Conference on Mathematical Foundations of Computer Science (MFCS'10), pp.537-548, 2010.
DOI : 10.1007/978-3-642-15155-2_47

M. Droste and I. Meinecke, Regular Expressions on Average and in the Long Run, Proceedings of the 15th International Conference on Implementation and Application of Automata (CIAA'10), pp.211-221, 2010.
DOI : 10.1016/S0019-9958(61)80020-X

Y. Deng and C. Palamidessi, Axiomatizations for probabilistic finite-state behaviors, Theoretical Computer Science, vol.373, issue.1-2, pp.92-114, 2007.
DOI : 10.1016/j.tcs.2006.12.008
URL : https://hal.archives-ouvertes.fr/hal-00159682

M. Droste and B. Pibaljommee, Weighted Nested Word Automata and Logics over Strong Bimonoids, Proceedings of the 17th International Conference on Implementation and Application of Automata (CIAA'12), pp.138-148, 2012.
DOI : 10.1007/978-3-642-31606-7_12

[. Droste, C. Pech, and H. Vogler, A Kleene Theorem for Weighted Tree Automata, Theory of Computing Systems, pp.1-38, 2004.
DOI : 10.1007/s00224-004-1096-z

M. Droste and G. Rahonis, Weighted Automata and Weighted Logics with Discounting, Proceedings of the 12th International Conference on Implementation and Application of Automata (CIAA'07), pp.73-84, 2007.
DOI : 10.1007/978-3-540-76336-9_9

C. Dwork and L. J. Stockmeyer, On the power of 2-way probabilistic finite state automata, 30th Annual Symposium on Foundations of Computer Science, pp.480-485, 1989.
DOI : 10.1109/SFCS.1989.63522

M. Droste and H. Vogler, Weighted tree automata and weighted logics, Theoretical Computer Science, vol.366, issue.3, pp.228-247, 2006.
DOI : 10.1016/j.tcs.2006.08.025
URL : http://doi.org/10.1016/j.tcs.2006.08.025

M. Droste and H. Vogler, Weighted Logics for Unranked Tree Automata, Theory of Computing Systems, 2009.
DOI : 10.1007/s00224-009-9224-4

J. Engelfriet and H. J. Hoogeboom, Tree-Walking Pebble Automata. Jewels are forever, contributions to Theoretical, pp.72-83, 1999.
DOI : 10.1007/978-3-642-60207-8_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.2196

J. Engelfriet and H. J. Hoogeboom, Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure, Logical Methods in Computer Science, vol.3, issue.2, pp.1-27, 2007.
DOI : 10.2168/LMCS-3(2:3)2007
URL : http://arxiv.org/abs/cs/0703079

[. Engelfriet, H. J. Hoogeboom, and B. Samwel, XML transformation by tree-walking transducers with invisible pebbles, Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '07, pp.63-72, 2007.
DOI : 10.1145/1265530.1265540

C. Calvin and . Elgot, Decision Problems of Finite Automata Design and Related Arithmetics. Transactions of the, pp.21-52, 1961.

[. Franceschet, B. Maarten-de-rijke, and . Schlingoff, Hybrid logics on linear structures: expressivity and complexity, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings., pp.192-202, 2003.
DOI : 10.1109/TIME.2003.1214893

H. Fijalkow, Y. Gimbert, and . Oualhadj, Deciding the Value 1 Problem for Probabilistic Leaktight Automata, Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS'12), pp.295-304, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01140262

[. Fischer, F. Huch, and T. Wilke, A Play on Regular Expressions: Functional Pearl, Proceedings of the 15th ACM SIGPLAN International Conference on Functional Programming, 2010.

[. Fichtner, Characterizations of Recognizable Picture Series, 2007.

[. Fichtner, Weighted Picture Automata and Weighted Logics, Theory of Computing Systems, pp.48-78, 2011.
DOI : 10.1007/s00224-009-9225-3

J. Michael, R. E. Fischer, and . Ladner, Propositional Dynamic Logic of Regular Programs, Journal of Computer and System Sciences, vol.18, pp.194-211, 1979.

R. W. Floyd, Algorithm 97: Shortest path, Communications of the ACM, vol.5, issue.6, p.345, 1962.
DOI : 10.1145/367766.368168

U. Fahrenberg, K. G. Larsen, and C. Thrane, Quantitative Analysis of Weighted Transition Systems, Journal of Logic and Algebraic Programming, vol.79, pp.689-703, 2010.

[. Fülöp and L. Muzamel, Weighted Tree-Walking Automata, Acta Cybernetica, vol.19, pp.275-293, 2009.

M. Victor and . Glushkov, On a Synthesis Algorithm for Abstract Automata, Ukrainian Mathematical Journal, vol.12, issue.2, pp.147-156, 1960.

M. Victor and . Glushkov, The Abstract Theory of Automata, Russian Mathematical Surveys, vol.16, pp.1-53, 1961.

H. Gimbert and Y. Oualhadj, Probabilistic Automata on Finite Words: Decidable and Undecidable Problems, Proceedings of the 37th International Colloquium conference on Automata, Languages and Programming: Part II (ICALP'10), pp.527-538, 2010.
DOI : 10.1007/978-3-642-14162-1_44
URL : https://hal.archives-ouvertes.fr/hal-00456538

J. S. Golan, Semirings and their Applications, 1999.
DOI : 10.1007/978-94-015-9333-5

[. Hoffmann, One Pebbles Does Not Suffice to Search Plane Labyrinths. Fundamentals of Computation Theory, pp.433-444, 1981.

I. Hodkinson and M. Reynolds, Separation -Past, Present, and Future, Essays in Honour of Dov Gabbay on his 60th Birthday, pp.117-142, 2005.

E. John, J. D. Hopcroft, and . Ullman, An Introduction to Automata Theory, Languages, and Computation, 1979.

M. Kaminski and N. Francez, Finite-memory automata, Theoretical Computer Science, vol.134, issue.2, pp.329-363, 1994.
DOI : 10.1016/0304-3975(94)90242-9

C. Stephen and . Kleene, Representation of Events in Nerve Nets and Finite Automata, Automata Studies, pp.3-42, 1956.

K. Knight and J. May, Applications of Weighted Automata in Natural Language Processing, Handbook of Weighted Automata, pp.555-579, 2009.
DOI : 10.1007/978-3-642-01492-5_14

. Kmo-+-12-]-stefan, A. S. Kiefer, J. Murawski, B. Ouaknine, J. Wachter et al., On the Complexity of the Equivalence Problem for Probabilistic Automata, Proceedings of the 15th International Conference on Foundations of Software Science and Computational Structures (FoSSaCS'12), pp.467-481, 2012.

[. Kwiatkowska, G. Norman, and D. Parker, PRISM 4.0: Verification of Probabilistic Real-Time Systems, Proceedings of the 23rd International Conference on Computer Aided Verification (CAV'11), pp.585-591, 2011.
DOI : 10.1007/3-540-45657-0_17
URL : https://hal.archives-ouvertes.fr/hal-00648035

W. Kuich and A. Salomaa, Semirings, Automata and Languages. EATCS Monographs in Theoretical Computer Science, 1985.
DOI : 10.1007/978-3-642-69959-7

W. Kuich, Semirings and Formal Power Series: Their Relevance to Formal Languages and Automata, Handbook of Formal Languages, pp.609-678, 1997.
DOI : 10.1007/978-3-642-59136-5_9

M. Lange, Model checking propositional dynamic logic with all extras, Journal of Applied Logic, vol.4, issue.1, pp.39-49, 2005.
DOI : 10.1016/j.jal.2005.08.002

[. Lodaya, P. K. Pandya, and S. S. Shah, Marking the chops: an unambiguous temporal logic, Fifth IFIP International Conference On Theoretical Computer Science (TCS'08), pp.461-476, 2008.
DOI : 10.1007/978-0-387-09680-3_31

S. Lombardy, Y. Régis-gianas, and J. Sakarovitch, Introducing VAUCANSON, Theoretical Computer Science, vol.328, issue.1-2, pp.77-96, 2004.
DOI : 10.1016/j.tcs.2004.07.007
URL : https://hal.archives-ouvertes.fr/hal-00620038

M. Leucker and C. Sánchez, Regular Linear Temporal Logic, Proceedings of the 4th International Conference on Theoretical Aspects of Computing, pp.291-305, 2007.
DOI : 10.1007/978-3-540-75292-9_20

M. Marx, Conditional XPath, the first order complete XPath dialect, Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '04, pp.13-22, 2004.
DOI : 10.1145/1055558.1055562

O. Matz, One quantifier will do in existential monadic second-order logic over pictures, Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS'98), pp.751-759, 1998.
DOI : 10.1007/BFb0055826

[. Mathissen, Weighted Logics for Nested Words and Algebraic Formal Power Series, Logical Methods in Computer Science, vol.6, issue.1, 2010.

L. Marvin and . Minsky, Computation: Finite and Infinite Machines, 1967.

[. Mohri, Weighted Automata Algorithms, Handbook of Weighted Automata, pp.213-254
DOI : 10.1007/978-3-642-01492-5_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.308.1601

F. Robert, H. M. Mcnaughton, and . Yamada, Regular Expressions and State Graphs for Automata, IRE Transactions on Electronic Computers, issue.91, pp.39-47, 1960.

A. Paz, Introduction to Probabilistic Automata, 1971.

O. Michael and . Rabin, Probabilistic Automata, Information and Control, vol.6, issue.3, pp.230-245, 1963.

G. Rahonis, Weighted Müller Tree Automata and Weighted Logics, Journal of Automata Languages and Combinatorics, vol.12, pp.455-483, 2007.

[. Ravikumar, On some variations of two-way probabilistic finite automata models, Theoretical Computer Science, vol.376, issue.1-2, pp.127-136, 2007.
DOI : 10.1016/j.tcs.2007.01.017

]. H. Rol80 and . Rollik, Automaten in Planaren Graphen, Acta Informatica, vol.13, issue.3, pp.287-298, 1980.

O. Michael, D. Rabin, and . Scott, Finite Automata and Their Decision Problems, IBM Journal of Research and Development, vol.3, issue.2, pp.114-125, 1959.

J. Sakarovitch, Elements of Automata Theory, 2009.
DOI : 10.1017/CBO9781139195218

J. Sakarovitch, Automata and Expressions, AutoMathA Handbook. 2012
URL : https://hal.archives-ouvertes.fr/hal-01114758

A. Silva, F. Bonchi, M. Bonsangue, and J. Rutten, Quantitative Kleene coalgebras, Information and Computation, vol.209, issue.5, pp.822-849, 2011.
DOI : 10.1016/j.ic.2010.09.007
URL : https://hal.archives-ouvertes.fr/hal-00777557

[. Schützenberger, On the definition of a family of automata, Information and Control, vol.4, issue.2-3, pp.245-270, 1961.
DOI : 10.1016/S0019-9958(61)80020-X

[. Segala, Probability and Nondeterminism in Operational Models of Concurrency, Proceedings of the 17th International Conference on Concurrency Theory (CONCUR'06), pp.64-78, 2006.
DOI : 10.1007/11817949_5

C. John and . Shepherdson, The Reduction of Two-Way Automata to One-Way Automata, IBM Journal of Research and Development, vol.3, issue.2, pp.198-200, 1959.

M. Samuelides and L. Segoufin, Complexity of Pebble Tree-Walking Automata, Proceedings of the 16th International Conference on Fundamentals of Computation Theory, pp.458-469, 2007.
DOI : 10.1007/978-3-540-74240-1_40
URL : https://hal.archives-ouvertes.fr/hal-00158716

L. Balder-ten-cate and . Segoufin, Transitive closure logic, and nested tree walking automata, and Xpath, Journal of the ACM, vol.57, issue.3, pp.1-41, 2010.
DOI : 10.1145/1706591.1706598

[. Thomas, Classifying regular events in symbolic logic, Journal of Computer and System Sciences, vol.25, issue.3, pp.360-376, 1982.
DOI : 10.1016/0022-0000(82)90016-2

W. Thomas, . On-logics, and A. Tilings, On logics, tilings, and automata, Proceedings of the 18th International Colloquium on Automata, Languages and Programming (ICALP'91), pp.441-453
DOI : 10.1007/3-540-54233-7_154

A. Boris and . Trakhtenbrot, Finite Automata and Logic of Monadic Predicates, Doklady Akademii Nauk SSSR, vol.149, pp.326-329, 1961.

[. Tzeng, A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata, SIAM Journal on Computing, vol.21, issue.2, pp.216-227, 1992.
DOI : 10.1137/0221017

M. Y. Vardi, Alternating automata and program verification, In Computer Science Today Lecture Notes in Computer Science, vol.1000, pp.471-485, 1995.
DOI : 10.1007/BFb0015261
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.2048

M. Y. Vardi, On the Complexity of Bounded-Variable Queries, Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'95), pp.266-276, 1995.

Y. Moshe, P. Vardi, and . Wolper, An Automata-Theoretic Approach to Automatic Program Verification, Proceedings of the 1st Annual Symposium on Logic in Computer Science (LICS'86), pp.332-344, 1986.

[. Warshall, A Theorem on Boolean Matrices, Journal of the ACM, vol.9, issue.1, pp.11-12, 1962.
DOI : 10.1145/321105.321107

[. Weidner, Probabilistic Automata and Probabilistic Logic, Proceedings of the 37th International Conference on Mathematical Foundations of Computer Science (MFCS'12), pp.813-824, 2012.
DOI : 10.1007/978-3-642-32589-2_70