Attributes | Values |
---|
rdf:type
| |
rdfs:seeAlso
| |
Description
| - Clearing restarting automata are based on contextual rewriting. A word w is accepted by an automaton of this type if there is a computation that reduces the word w to the empty word Î}} by a finite sequence of rewritings. Accordingly, the word problem for a clearing restarting automaton can be solved nondeterministically in quadratic time. If, however, the contextual rewritings happen to be Î}}-confluent, that is, confluent on the congruence class of the empty word, then the word problem can be solved deterministically in linear time. Here we show that, unfortunately, Î}}-confluence is not even recursively enumerable for clearing restarting automata. This follows from the fact that Î}}-confluence is not recursively enumerable for finite factor-erasing string-rewriting systems.
- Clearing restarting automata are based on contextual rewriting. A word w is accepted by an automaton of this type if there is a computation that reduces the word w to the empty word Î}} by a finite sequence of rewritings. Accordingly, the word problem for a clearing restarting automaton can be solved nondeterministically in quadratic time. If, however, the contextual rewritings happen to be Î}}-confluent, that is, confluent on the congruence class of the empty word, then the word problem can be solved deterministically in linear time. Here we show that, unfortunately, Î}}-confluence is not even recursively enumerable for clearing restarting automata. This follows from the fact that Î}}-confluence is not recursively enumerable for finite factor-erasing string-rewriting systems. (en)
|
Title
| - Lambda-Confluence Is Undecidable for Clearing Restarting Automata
- Lambda-Confluence Is Undecidable for Clearing Restarting Automata (en)
|
skos:prefLabel
| - Lambda-Confluence Is Undecidable for Clearing Restarting Automata
- Lambda-Confluence Is Undecidable for Clearing Restarting Automata (en)
|
skos:notation
| - RIV/00216208:11320/13:10145557!RIV14-GA0-11320___
|
http://linked.open...avai/predkladatel
| |
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216208:11320/13:10145557
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - limited context restarting automaton; factor-erasing string-rewriting system; Clearing restarting automaton; lamda-confluence (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...v/mistoKonaniAkce
| |
http://linked.open...i/riv/mistoVydani
| |
http://linked.open...i/riv/nazevZdroje
| - Implementation and Application of Automata
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...iv/tvurceVysledku
| - Mráz, František
- Otto, Friedrich
|
http://linked.open...vavai/riv/typAkce
| |
http://linked.open.../riv/zahajeniAkce
| |
issn
| |
number of pages
| |
http://bibframe.org/vocab/doi
| - 10.1007/978-3-642-39274-0_23
|
http://purl.org/ne...btex#hasPublisher
| |
https://schema.org/isbn
| |
http://localhost/t...ganizacniJednotka
| |