Champarnaud, Jean-Marc; Laugerotte, Éric; Ouardi, Faissal; Ziadi, Djelloul From regular weighted expressions to finite automata. (English) Zbl 1098.68066 Int. J. Found. Comput. Sci. 15, No. 5, 687-700 (2004). Summary: We generalize concepts of the position automaton and ZPC-structune to the regular \(\mathbb{K}\)-expressions. We show that the extended ZPC-structure can be built in linear time with respect to the size of the \(\mathbb{K}\)-expression and that the associated position automaton can be deduced from it in quadratic time. Cited in 4 Documents MSC: 68Q45 Formal languages and automata Keywords:weighted automata PDFBibTeX XMLCite \textit{J.-M. Champarnaud} et al., Int. J. Found. Comput. Sci. 15, No. 5, 687--700 (2004; Zbl 1098.68066) Full Text: DOI References: [1] DOI: 10.1016/0304-3975(95)00182-4 · Zbl 0872.68120 [2] DOI: 10.1007/978-3-642-73235-5 [3] DOI: 10.1007/3-540-44674-5_5 [4] DOI: 10.1016/S0304-3975(00)00293-0 · Zbl 0984.68102 [5] DOI: 10.1007/3-540-36390-4_5 [6] DOI: 10.1007/3-540-48194-X_15 [7] Glushkov V.-M., The abstract theory of automata 16 pp 1– · Zbl 0104.35404 [8] Hebisch U., Semirings: algebraic theory and applications in computer science (1993) · Zbl 0829.16035 [9] DOI: 10.1007/978-3-642-69959-7 [10] McNaughton R. F., IEEE Tans. Electronic Comput. 9 pp 39– [11] Schützenberger M. P., On the definition of a family of automata 6 pp 245– · Zbl 0104.00702 [12] Ziadi D., Bull. Bel. Math. Soc. 4 pp 177– This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.