Decidability conditions for problems about automata reading infinite words (Q5263763)
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: Decidability conditions for problems about automata reading infinite words |
scientific article; zbMATH DE number 6459999
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decidability conditions for problems about automata reading infinite words |
scientific article; zbMATH DE number 6459999 |
Statements
17 July 2015
0 references
infinite word
0 references
regular language
0 references
algorithmic decidability
0 references
monadic theory
0 references
0.8146904110908508
0 references
0.8040143251419067
0 references
0.7700566649436951
0 references
0.7699922919273376
0 references
