Ambiguity Hierarchy of Regular Infinite Tree Languages

09/07/2020
by   Alexander Rabinovich, et al.
0

An automaton is unambiguous if for every input it has at most one accepting computation. An automaton is k-ambiguous (for k>0) if for every input it has at most k accepting computations. An automaton is boundedly ambiguous if there is k, such that for every input it has at most k accepting computations. An automaton is finitely (respectively, countably) ambiguous if for every input it has at most finitely (respectively, countably) many accepting computations. The degree of ambiguity of a regular language is defined in a natural way. A language is k-ambiguous (respectively, boundedly, finitely, countably ambiguous) if it is accepted by a k-ambiguous (respectively, boundedly, finitely, countably ambiguous) automaton. Over finite words, every regular language is accepted by a deterministic automaton. Over finite trees, every regular language is accepted by an unambiguous automaton. Over ω-words every regular language is accepted by an unambiguous Büchi automaton and by a deterministic parity automaton. Over infinite trees, Carayol et al. showed that there are ambiguous languages. We show that over infinite trees there is a hierarchy of degrees of ambiguity: For every k>1 there are k-ambiguous languages which are not k-1 ambiguous; and there are finitely (respectively countably, uncountably) ambiguous languages which are not boundedly (respectively finitely, countably) ambiguous.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/25/2019

Polynomially Ambiguous Probabilistic Automata on Restricted Languages

We consider the computability and complexity of decision questions for P...
research
11/29/2022

Testing GLOM's ability to infer wholes from ambiguous parts

The GLOM architecture proposed by Hinton [2021] is a recurrent neural ne...
research
03/12/2021

Non-ambiguous trees: new results and generalisation (Full version)

We present a new definition of non-ambiguous trees (NATs) as labelled bi...
research
02/13/2023

Deterministic regular functions of infinite words

Regular functions of infinite words are (partial) functions realized by ...
research
11/16/2022

GAMMT: Generative Ambiguity Modeling Using Multiple Transformers

We introduce a new model based on sets of probabilities for sequential d...
research
02/16/2022

Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable

We consider the problems of language inclusion and language equivalence ...
research
06/19/2018

Non-deterministic Behavior of Ranking-based Metrics when Evaluating Embeddings

Embedding data into vector spaces is a very popular strategy of pattern ...

Please sign up or login with your details

Forgot password? Click here to reset