Language equations with complementation: Expressive power

Authors:
Alexander Okhotin;Oksana Yakimova
Affiliations:
Department of Mathematics, University of Turku, Turku, FI-20014, Finland and Academy of Finland, Finland;Centro di Ricerca Matematica Ennio De Giorgi, Collegio Puteano, Scuola Normale Superiore, Pisa, I-56100, Italy
Venue:
Theoretical Computer Science
Year:
2012

Citing 19
Cited 2

Unrestricted complementation in language equations over a one-letter alphabet

Theoretical Computer Science
Two Families of Languages Related to ALGOL

Journal of the ACM (JACM)
Unification of concept terms in description logics

Journal of Symbolic Computation
Conjunctive grammars

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
Factorizations of languages and commutativity conditions

Acta Cybernetica
Boolean grammars

Information and Computation
The dual of concatenation

Theoretical Computer Science - Mathematical foundations of computer science 2004
On the existence of prime decompositions

Theoretical Computer Science
Language equations with complementation: Decision problems

Theoretical Computer Science
Recursive descent parsing for Boolean grammars

Acta Informatica
The Power of Commuting with Finite Sets of Words

Theory of Computing Systems
On the Computational Completeness of Equations over Sets of Natural Numbers

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Well-founded semantics for Boolean grammars

Information and Computation
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth

Theory of Computing Systems - Special Issue: Symposium on Computer Science, Guest Editors: Sergei Artemov, Volker Diekert and Dima Grigoriev
Decision problems for language equations

Journal of Computer and System Sciences
Conjunctive grammars with restricted disjunction

Theoretical Computer Science
Fast parsing for Boolean grammars: a generalization of Valiant's algorithm

DLT'10 Proceedings of the 14th international conference on Developments in language theory
Language equations with symmetric difference

CSR'06 Proceedings of the First international computer science conference on Theory and Applications
On language inequalities XK ⊆ LX

DLT'05 Proceedings of the 9th international conference on Developments in Language Theory

On the expressive power of univariate equations over sets of natural numbers

Information and Computation
Language Equations with Symmetric Difference

Fundamenta Informaticae - Words, Graphs, Automata, and Languages; Special Issue Honoring the 60th Birthday of Professor Tero Harju

Quantified Score

Hi-index	5.23

Visualization

Abstract

Consider a system of language equations of the form X"i=@f"i(X"1,...,X"n)(1=