Parallel Hyperedge Replacement String Languages

02/04/2021
by   Graham Campbell, et al.
0

There are many open questions surrounding the characterisation of groups with context-sensitive word problem. Only in 2018 was it shown that all finitely generated virtually Abelian groups have multiple context-free word problems, and it is a long-standing open question as to where to place the word problems of hyperbolic groups in the formal language hierarchy. In this paper, we introduce a new language class called the parallel hyperedge replacement string languages, show that it contains all multiple context-free and ET0L languages, and lay down the foundations for future work that may be able to place the word problems of many hyperbolic groups in this class.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/07/2021

Parallel Hyperedge Replacement Grammars

In 2018, it was shown that all finitely generated virtually Abelian grou...
research
02/19/2019

Solutions sets to systems of equations in hyperbolic groups are EDT0L in PSPACE

We show that the full set of solutions to systems of equations and inequ...
research
05/01/2022

Formal Languages via Theories over Strings

We investigate the properties of formal languages expressible in terms o...
research
11/25/2021

On formally undecidable propositions in nondeterministic languages

Any class of languages 𝐋 accepted in time 𝐓 has a counterpart 𝐍𝐋 accepte...
research
03/22/2020

The Power of a Single Qubit: Two-way Quantum Finite Automata and the Word Problem

The two-way finite automaton with quantum and classical states (2QCFA), ...
research
03/16/2022

On the complexity of the word problem of the R. Thompson group V

We analyze the proof by Lehnert and Schweitzer that the word problem of ...
research
11/02/2018

Unsupervised Hyperalignment for Multilingual Word Embeddings

We consider the problem of aligning continuous word representations, lea...

Please sign up or login with your details

Forgot password? Click here to reset