Result: Equivalence of simple functions
Title:
Equivalence of simple functions
Source:
Developments in language theoryTheoretical computer science. 376(1-2):42-51
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 12 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme, Algorithm, Algoritmo, Alphabet, Alfabeto, Grammaire CF, Context free grammar, Gramática independiente, Informatique théorique, Computer theory, Informática teórica, Langage formel, Formal language, Lenguaje formal, Longueur mot, Word length, Longitud palabra, Temps polynomial, Polynomial time, Tiempo polinomial, Transducteur, Transducer, Transductor, Fonction partielle, Fonction simple, Simple function, Problème équivalence, Context-free grammar, Equivalence problem, Push-down transducer, Simple grammar
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dept d'informatique, Université du Québec en Outaouais, Gatineau PQ, Canada
IDT Canada Inc, Ottawa ON, Canada
Inst. of Informatics, Warsaw University, Warsaw, Poland
IDT Canada Inc, Ottawa ON, Canada
Inst. of Informatics, Warsaw University, Warsaw, Poland
ISSN:
0304-3975
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.18748486
Database:
PASCAL Archive
Further Information
A partial function F : Σ* → Ω* is called a simple function if F(w) ∈Ω* is the output produced in the leftmost derivation 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 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.