Formal Languages via Theories over Strings

05/01/2022
by   Joel D. Day, et al.
0

We investigate the properties of formal languages expressible in terms of formulas over quantifier-free theories of word equations, arithmetic over length constraints, and language membership predicates for the classes of regular, visibly pushdown, and deterministic context-free languages. In total, we consider 20 distinct theories and decidability questions for problems such as emptiness and universality for formal languages over them. First, we discuss their relative expressive power and observe a rough division into two hierarchies based on whether or not word equations are present. Second, we consider the decidability status of several important decision problems, such as emptiness and universality. Note that the emptiness problem is equivalent to the satisfiability problem over the corresponding theory. Third, we consider the problem of whether a language in one theory is expressible in another and show several negative results in which this problem is undecidable. These results are particularly relevant in the context of normal forms in both practical and theoretical aspects of string solving.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2018

Decidable Logics Combining Word Equations, Regular Expressions and Length Constraints

In this work, we consider the satisfiability problem in a logic that com...
research
09/11/2022

Information content in formal languages

Motivated by creating physical theories, formal languages S with variabl...
research
08/20/2021

The n-ary Initial Literal and Literal Shuffle

The literal and the initial literal shuffle have been introduced to mode...
research
08/09/2018

Hunting for Tractable Languages for Judgment Aggregation

Judgment aggregation is a general framework for collective decision maki...
research
02/04/2021

Parallel Hyperedge Replacement String Languages

There are many open questions surrounding the characterisation of groups...
research
01/07/2021

Parallel Hyperedge Replacement Grammars

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

Tensor Product Representations of Subregular Formal Languages

This paper provides a geometric characterization of subclasses of the re...

Please sign up or login with your details

Forgot password? Click here to reset