Searching for "R-Automata." – sorted by Relevance.
-
R-automata ⋆
- R-automata ⋆ Parosh Aziz Abdulla, Pavel Krcal, and Wang Yi Department of Information Technology
- Add To MetaCart
-
Restarting Automata
- -free languages { by deterministic monotonic R-automata. We also show that the monotonocity property
- Cited by 13 (5 self) – Add To MetaCart
-
Restarting Automata
- monotonic R-automata. We also show that the monotonicity property is decidable and complete the paper
- Cited by 6 (5 self) – Add To MetaCart
-
An automata-theoretic approach of the word problem for ω-terms over R
- semigroups and we use it to associate R-trees and R-automata to pseudowords over R. These objects are used
- Cited by 3 (3 self) – Add To MetaCart
-
Restarting Automata, Marcus Grammars and Context-Free Languages
- of \cutting o" do not increase their distances from the right end) and showed that deterministic monotonic R-automata
- Cited by 4 (1 self) – Add To MetaCart
-
The equational theory of ω-terms for finite R-trivial semigroups
- . R-trees and R-automata Elements of free profinite semigroups will be generally called pseudowords
- Cited by 1 (1 self) – Add To MetaCart
-
Deleting Automata with a Restart Operation and Marcus Grammars
- on the list. In [5] we defined R-automata (restarting automata) -- a special type of deleting automata with a
- Cited by 1 (0 self) – Add To MetaCart
-
Deleting Automata with a Restart Operation
- are then called DR-automata (i.e. `Deleting automata with a Restart operation'). In [4] we defined R-automata
- Cited by 2 (1 self) – Add To MetaCart
-
Restarting automata, Church-Rosser languages, and confluent internal contextual languages
- in [JMPV97] are just the classes of pure RW-automata. Obviously, R-automata are always pure. In [JMPV97
- Cited by 5 (2 self) – Add To MetaCart
-
On Restarting Automata with Rewriting
- , in [4], we have introduced restarting automata without rewriting { R-automata { by which the replacing
- Cited by 7 (2 self) – Add To MetaCart

