Topology and Ambiguity in Omega Context Free Languages
| dc.creator | Finkel, Olivier | |
| dc.creator | Simonnet, Pierre | |
| dc.date | 2008-01-03 | |
| dc.date.accessioned | 2026-07-07T08:52:21Z | |
| dc.date.available | 2026-07-07T08:52:21Z | |
| dc.description | We study the links between the topological complexity of an omega context free language and its degree of ambiguity. In particular, using known facts from classical descriptive set theory, we prove that non Borel omega context free languages which are recognized by Büchi pushdown automata have a maximum degree of ambiguity. This result implies that degrees of ambiguity are really not preserved by the operation of taking the omega power of a finitary context free language. We prove also that taking the adherence or the delta-limit of a finitary language preserves neither unambiguity nor inherent ambiguity. On the other side we show that methods used in the study of omega context free languages can also be applied to study the notion of ambiguity in infinitary rational relations accepted by Büchi 2-tape automata and we get first results in that direction. | |
| dc.identifier | https://arxiv.org/abs/0801.0533 | |
| dc.identifier | http://arxiv.org/abs/0801.0533 | |
| dc.identifier | Bulletin of the Belgian Mathematical Society 10 (5) (2003) 707-722 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/145250 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Logic | |
| dc.title | Topology and Ambiguity in Omega Context Free Languages | |
| dc.type | text |