Abstract
In recent years an increasing interest in regular sets for different kinds of elements could be observed. The introduction of XML has led to investigations of regular sets of both ranked and unranked trees and also of attributed unranked trees.
The aim of this short note is to introduce a uniform notion of regularity. If instantiated for strings, ranked trees and unranked trees it will coincide with the existing concepts and it can easily be extended to arbitrary data types. This leads to a natural notion of regularity for different kinds of attributed unranked trees and also to regular sets of structured elements which have not yet been investigated. The approach takes advantage from freeness constraints and parametric abstract data types as offered by the algebraic specification language Casl
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Murata, M., Brüggemann-Klein, A., Wood, D.: Regular tree and regular hedge languages over unranked alphabets: Version 1. Technical Report HKUST-TCSC- 2001-0, The Hongkong University of Science and Technology (April 2001)
Burstall, R.M., Tarlecki, A., Goguen, J.A.: Some fundamental algebraic tools for the semantics of computation - part III: Indexed categories. TCS (91), 239–264 (1991)
Barr, M., Wells, C.: Category Theory for Computing Science, 2nd edn. International Series in Computer Science, Prentice–Hall, Englewood Cliffs (1995)
Bidoit, M., Mosses, P.D.: CASL User Manual. LNCS, vol. 2900. Springer, Heidelberg (2004)
Burstall, R., Goguen, J.: The semantics of CLEAR, a specification language, vol. 86, pp. 292–332. Springer, Heidelberg (1979)
Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. In: eatcs monographs on theoretical computer science edition, vol. 6, Springer, Heidelberg (1985)
Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 2: Module Specifications and Constraints. In: eatcs monographs on theoretical computer science edition, vol. 21, Springer, Heidelberg (1990)
Goguen, J.A.: A categorical manifesto. Math. Struct. Comp. Sci. 1(1), 49–67 (1991)
Indermark, K.: On rational definitions in complete algebras without rank. Theoretical Computer Science 21, 281–313 (1982)
Wada, Y., Hashiguchi, K., Jimbo, S.: Regular binoid expressions and regular binoid languages. Theoretical Computer Science 304, 291–313 (2003)
Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 2–26. Springer, Heidelberg (2002)
Neven, F.: Automata theory for XML researchers. SIGMOD Record 31(3) (2002)
Rutten, J.J.M.M.: Behavioural differential equations: a coinductive calculus of streams, automata, and power series. Theoretical Computer Science 308(1-3), 1–53 (2003)
Thatcher, J.W., Wright, J.B.: Generlized finite automata theory with an application to a decision problem of second–order logic. Mathematical Systems Theory 2(1), 57–81 (1968)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Reichel, H. (2006). An Algebraic Approach to Regular Sets. In: Futatsugi, K., Jouannaud, JP., Meseguer, J. (eds) Algebra, Meaning, and Computation. Lecture Notes in Computer Science, vol 4060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780274_23
Download citation
DOI: https://doi.org/10.1007/11780274_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35462-8
Online ISBN: 978-3-540-35464-2
eBook Packages: Computer ScienceComputer Science (R0)