Solvable problems for transformers with reversal-bounded counters (Q3747751): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Strict sets and finite semigroup coverings / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4055582 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5186756 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5613949 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Diophantine Problem for Addition and Divisibility / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank | |||
Normal rank | |||
Revision as of 18:07, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solvable problems for transformers with reversal-bounded counters |
scientific article |
Statements
Solvable problems for transformers with reversal-bounded counters (English)
0 references
1985
0 references
equivalence problem
0 references
finite transformers with reversal-bounded counters
0 references
linearly rigid semigroup
0 references
transformers on marked trees
0 references
nonemptiness of a recognizable language
0 references
two-way deterministic finite automata
0 references
functional equivalence
0 references
