Abstract
We mainly investigate the power of weight-reducing string-rewriting systems in the context of transducing observer systems. First we relate them to a special type of restarting transducer. Then we situate them between painter and length-reducing systems. Further we show that for every weight-reducing system there is an equivalent one that uses only weight-reducing painter rules. This result enables us to prove that the class of relations that is computed by transducing observer systems with weight-reducing rules is closed under intersection.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Aho, A., Ullman, J.: The Theory of Parsing, Translation, and Compiling. Prentice-Hall, Upper Saddle River (1972)
Book, R., Otto, F.: String-Rewriting Systems. Springer, Berlin (1993)
Cavaliere, M., Leupold, P.: Evolution and Observation – A Non-Standard Way to Generate Formal Languages. Theoretical Computer Science 321, 233–248 (2004)
Cavaliere, M., Leupold, P.: Observation of String-Rewriting Systems. Fundamenta Informaticae 74(4), 447–462 (2006)
Hundeshagen, N., Leupold, P.: Transducing by observing. In: Bordihn, H., Freund, R., Hinze, T., Holzer, M., Kutrib, M., Otto, F. (eds.) NCMA. books@ocg.at, vol. 263, pp. 85–98. Österreichische Computergesellschaft (2010)
Hundeshagen, N., Leupold, P.: Transducing by Observing Length-Reducing and Painter Rules. RAIRO - Theor. Inf. and Applic. 48(1), 85–105 (2014)
Hundeshagen, N., Otto, F.: Characterizing the rational functions by restarting transducers. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 325–336. Springer, Heidelberg (2012)
Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 283–292. Springer, Heidelberg (1995)
Jurdzinski, T., Otto, F.: Shrinking Restarting Automata. Int. J. Found. Comput. Sci. 18(2), 361–385 (2007)
Leupold, P.: Is computation observer-relative? In: Bensch, S., Freund, R., Otto, F. (eds.) Proceedings of Sixth Workshop on Non-Classical Models for Automata and Applications - NCMA 2014, Kassel, Germany, July 28–29, 2014. books@ocg.at, vol. 304, pp. 13–27. Österreichische Computer Gesellschaft (2014)
Leupold, P.: What is the role of the observer in a computation? In: Proceedings of 7th AISB Symposium on Computing and Philosophy: Is computation observer-relative? London (2014)
Otto, F.: Restarting automata. In: Ésik, Z., Martín-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. SCI, vol. 25, pp. 269–303. Springer, Heidelberg (2006)
Salomaa, A.: Formal Languages. Academic Press, New York (1973)
Searle, J.R.: The Rediscovery of the Mind. MIT Press (1992)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Leupold, P., Hundeshagen, N. (2015). A Hierarchy of Transducing Observer Systems. In: Dediu, AH., Formenti, E., Martín-Vide, C., Truthe, B. (eds) Language and Automata Theory and Applications. LATA 2015. Lecture Notes in Computer Science(), vol 8977. Springer, Cham. https://doi.org/10.1007/978-3-319-15579-1_57
Download citation
DOI: https://doi.org/10.1007/978-3-319-15579-1_57
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15578-4
Online ISBN: 978-3-319-15579-1
eBook Packages: Computer ScienceComputer Science (R0)