Abstract
A partial function F:Σ ∗ →Ω ∗ is called a simple function if F(w) ∈Ω* is the output produced in the generation of a word w ∈Σ* from a nonterminal of a simple context free grammar G with output alphabet Ω. In this paper we present an efficient algorithm for testing equivalence of simple functions. Such functions correspond also to one-state deterministic pushdown transducers. Our algorithm works in time polynomial with respect to |G|+ v(G), where |G| is the size of the textual description of G, and v(G) is the maximum of the shortest lengths of words generated by nonterminals of G.
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.
References
Bastien, C., Czyzowicz, J., Fraczak, W., Rytter, W.: Prime normal form and equivalence of simple grammars. In: Farré, J., Litovsky, I., Schmitz, S. (eds.) CIAA 2005. LNCS, vol. 3845, pp. 78–89. Springer, Heidelberg (2006)
Caucal, D.: A fast algorithm to decide on simple grammars equivalence. In: Djidjev, H.N. (ed.) Optimal Algorithms. LNCS, vol. 401, pp. 66–85. Springer, Heidelberg (1989)
Courcelle, B.: An axiomatic approach to the Korenjak-Hopcroft algorithms. Mathematical Systems Theory 16(3), 191–231 (1983)
Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, New York (1994)
Debski, W., Fraczak, W.: Concatenation state machines and simple functions. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 113–124. Springer, Heidelberg (2005)
Harrison, M.A.: Introduction to formal language theory. Addison-Wesley, Reading (1978)
Hirshfeld, Y., Jerrum, M., Moller, F.: A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science 158(1–2), 143–159 (1996)
Ibarra, O.H., Rosier, L.E.: On the decidability of equivalence of deterministic pushdown transducers. Information Processing Letters 13(3), 89–93 (1981)
Korenjak, A.J., Hopcroft, J.E.: Simple deterministic languages. In: Proc. IEEE 7th Annual Symposium on Switching and Automata Theory. IEEE Symposium on Foundations of Computer Science, pp. 36–46 (1966)
Lothaire: Combinatorics on words. Cambridge University Press, United Kingdom (1997)
Sénizergues, G.: T(A) = T(B)? In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 665–675. Springer, Heidelberg (1999)
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
Bastien, C., Czyzowicz, J., Fraczak, W., Rytter, W. (2006). Equivalence of Functions Represented by Simple Context-Free Grammars with Output. 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_8
Download citation
DOI: https://doi.org/10.1007/11779148_8
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)