On computational universality in language equations

Authors:
Alexander Okhotin
Affiliations:
School of Computing, Queen's University, Kingston, Ontario, Canada
Venue:
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Year:
2004

Citing 13
Cited 4

Maximal and minimal solutions to language equations

Journal of Computer and System Sciences
Context-free languages and pushdown automata

Handbook of formal languages, vol. 1
Two Families of Languages Related to ALGOL

Journal of the ACM (JACM)
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)
Theory of Automata

Theory of Automata
Conjunctive Grammars and Systems of Language Equations

Programming and Computing Software
Solution of parallel language equations for logic synthesis

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Conway's problem for three-word sets

Theoretical Computer Science
A Universal Turing Machine with 3 States and 9 Symbols

DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Nonterminal complexity of programmed grammars

Theoretical Computer Science
On the number of nonterminals in linear conjunctive grammars

Theoretical Computer Science
Reversal-bounded multipushdown machines

Journal of Computer and System Sciences
Decision problems for language equations with Boolean operations

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Computational Universality in One-variable Language Equations

Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Strict language inequalities and their decision problems

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
The power of commuting with finite sets of words

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Computational Universality in One-variable Language Equations

Fundamenta Informaticae - SPECIAL ISSUE MCU2004

Quantified Score

Hi-index	0.00

Visualization

Abstract

It has recently been shown that several computational models – trellis automata, recursive functions and Turing machines – admit characterization by resolved systems of language equations with different sets of language-theoretic operations. This paper investigates how simple the systems of equations from the computationally universal types could be while still retaining their universality. It is shown that resolved systems with two variables and two equations are as expressive as more complicated systems, while one-variable equations are “almost” as expressive. Additionally, language equations with added quotient with regular languages are shown to be able to denote every arithmetical set.