Result: Language equations with complementation : Decision problems
Title:
Language equations with complementation : Decision problems
Authors:
Source:
Developments in language theoryTheoretical computer science. 376(1-2):112-126
Publisher Information:
Amsterdam: Elsevier, 2007.
Publication Year:
2007
Physical Description:
print, 18 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, Complexité calcul, Computational complexity, Complejidad computación, Complémentation, Complementation, Complementación, Concaténation, Concatenation, Concatenación, Décidabilité, Decidability, Decidibilidad, Informatique théorique, Computer theory, Informática teórica, Négation, Negation, Negación, Système équation, Equation system, Sistema ecuación, Unicité solution, Solution uniqueness, Unicidad solución, Equation langage, Language equation, Problème décision, Decision problems, Language equations
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Academy of Finland, Vilhonvuorenkatu 6, Helsinki, 00501, Finland
Department of Mathematics, University of Turku, Yliopistonmäki, Turku, 20014, Finland
Max-Planck-Institut für Mathematik, Vivatsgasse 7, Bonn 53111, Germany
Department of Mathematics, University of Turku, Yliopistonmäki, Turku, 20014, Finland
Max-Planck-Institut für Mathematik, Vivatsgasse 7, Bonn 53111, Germany
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.18748492
Database:
PASCAL Archive
Further Information
Systems of language equations of the form Xi = φ (X1,...,Xn) (1 ≤ i ≤ n) are studied. Here every φi may contain the operations of concatenation and complementation. The properties of having solutions and of having a unique solution are given mathematical characterizations. As decision problems, the former is NP-complete, while the latter is PSPACE-hard and is in co-RE, and its decidability remains, in general, open. Uniqueness becomes decidable in the case of a unary alphabet, where it is US-complete, and in the case of linear concatenation, where it is L-complete.