Timed recursive state machines: expressiveness and complexity (Q264999)
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: Timed recursive state machines: expressiveness and complexity |
scientific article; zbMATH DE number 6561878
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Timed recursive state machines: expressiveness and complexity |
scientific article; zbMATH DE number 6561878 |
Statements
Timed recursive state machines: expressiveness and complexity (English)
0 references
1 April 2016
0 references
formal languages
0 references
formal models of computing
0 references
timed automata
0 references
real-time systems
0 references
pushdown systems
0 references
recursive state machines
0 references
0 references
0.89205456
0 references
0.88012445
0 references
0 references
0.8717068
0 references
0 references
0 references
0.8684814
0 references
