On the descriptional complexity of stateless deterministic ordered restarting automata (Q1706159)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the descriptional complexity of stateless deterministic ordered restarting automata |
scientific article; zbMATH DE number 6851692
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the descriptional complexity of stateless deterministic ordered restarting automata |
scientific article; zbMATH DE number 6851692 |
Statements
On the descriptional complexity of stateless deterministic ordered restarting automata (English)
0 references
21 March 2018
0 references
restarting automaton
0 references
ordered rewriting
0 references
descriptional complexity
0 references
language operations
0 references
decision problems
0 references
transductions
0 references
rational functions
0 references
0.9331541657447816
0 references
0.8961592316627502
0 references
0.8933177590370178
0 references
0.8564206957817078
0 references
0.8525031208992004
0 references
