Back to Search
Start Over
Equivalence of simple functions
- Source :
-
Theoretical Computer Science . May2007, Vol. 376 Issue 1/2, p42-51. 10p. - Publication Year :
- 2007
-
Abstract
- Abstract: A partial function is called a simple function if is the output produced in the leftmost derivation of a word from a nonterminal of a simple context free grammar with output alphabet . In this paper we present an efficient algorithm for testing the equivalence of simple functions. Such functions correspond also to one-state deterministic pushdown transducers. Our algorithm works in time polynomial with respect to , where is the size of the textual description of , and is the maximum of the shortest lengths of words generated by nonterminals of . [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 376
- Issue :
- 1/2
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 24711482
- Full Text :
- https://doi.org/10.1016/j.tcs.2007.01.011