Equivalence of functions represented by simple context-free grammars with output

Authors:
Cédric Bastien;Jurek Czyzowicz;Wojciech Fraczak;Wojciech Rytter
Affiliations:
Dépt d'informatique, Université du Québec en Outaouais, Gatineau, PQ, Canada;Dépt d'informatique, Université du Québec en Outaouais, Gatineau, PQ, Canada;Dépt d'informatique, Université du Québec en Outaouais, Gatineau, PQ, Canada;Institute of Informatics, Warsaw University, Warsaw, Poland
Venue:
DLT'06 Proceedings of the 10th international conference on Developments in Language Theory
Year:
2006

Citing 8
Cited 1

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
T(A) = T(B)?

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
A Fast Algorithm to Decide on Simple Grammars Equivalence

Proceedings of the International Symposium on Optimal Algorithms
Simple deterministic languages

SWAT '66 Proceedings of the 7th Annual Symposium on Switching and Automata Theory (swat 1966)
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

Reducing simple grammars: exponential against highly-polynomial time in practice

CIAA'06 Proceedings of the 11th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

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.