Linearly bounded infinite graphs
| dc.creator | Carayol, Arnaud | |
| dc.creator | Meyer, Antoine | |
| dc.date | 2007-05-24 | |
| dc.date.accessioned | 2026-07-07T08:03:03Z | |
| dc.date.available | 2026-07-07T08:03:03Z | |
| dc.description | Linearly bounded Turing machines have been mainly studied as acceptors for context-sensitive languages. We define a natural class of infinite automata representing their observable computational behavior, called linearly bounded graphs. These automata naturally accept the same languages as the linearly bounded machines defining them. We present some of their structural properties as well as alternative characterizations in terms of rewriting systems and context-sensitive transductions. Finally, we compare these graphs to rational graphs, which are another class of automata accepting the context-sensitive languages, and prove that in the bounded-degree case, rational graphs are a strict sub-class of linearly bounded graphs. | |
| dc.identifier | https://arxiv.org/abs/0705.3487 | |
| dc.identifier | http://arxiv.org/abs/0705.3487 | |
| dc.identifier | Acta Informatica 43, 4 (25/08/2006) p. 265-292 | |
| dc.identifier | doi:10.1007/s00236-006-0022-z | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/129438 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.1.1; F.4.3 | |
| dc.title | Linearly bounded infinite graphs | |
| dc.type | text |