Equivalence of simple functions

Authors:
Cédric Bastien;Jurek Czyzowicz;Wojciech Fraczak;Wojciech Rytter
Affiliations:
Dépt dinformatique, Université du Québec en Outaouais, Gatineau PQ, Canada;Dépt dinformatique, Université du Québec en Outaouais, Gatineau PQ, Canada;IDT Canada Inc., Ottawa ON, Canada and Dépt dinformatique, Université du Québec en Outaouais, Gatineau PQ, Canada;Inst. of Informatics, Warsaw University, Warsaw, Poland
Venue:
Theoretical Computer Science
Year:
2007

Citing 6
Cited 0

Text algorithms

Text algorithms
A polynomial algorithm for deciding bisimilarity of normed context-free processes

Theoretical Computer Science
Introduction to Formal Language Theory

Introduction to Formal Language Theory
A Fast Algorithm to Decide on Simple Grammars Equivalence

Proceedings of the International Symposium on Optimal Algorithms
Concatenation state machines and simple functions

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Prime normal form and equivalence of simple grammars

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	5.23

Visualization

Abstract

A partial function F:@S^*-@W^* is called a simple function if F(w)@?@W^* is the output produced in the leftmost derivation of a word w@?@S^* from a nonterminal of a simple context free grammar G with output alphabet @W. 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 |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.