Efficient recognition of trace languages defined by repeat-until loops (Q989291)
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: Efficient recognition of trace languages defined by repeat-until loops |
scientific article; zbMATH DE number 5773135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient recognition of trace languages defined by repeat-until loops |
scientific article; zbMATH DE number 5773135 |
Statements
Efficient recognition of trace languages defined by repeat-until loops (English)
0 references
19 August 2010
0 references
automata and formal languages
0 references
trace languages
0 references
local finite automata
0 references
integer compositions
0 references
dependencies checking
0 references
0.7833631038665771
0 references
0.7441650032997131
0 references
