Descriptional complexity of (un)ambiguous finite state machines and pushdown automata (Q3584958)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5776489
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Descriptional complexity of (un)ambiguous finite state machines and pushdown automata |
scientific article; zbMATH DE number 5776489 |
Statements
Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata (English)
0 references
31 August 2010
0 references
0.8007125854492188
0 references
0.7808675765991211
0 references
0.7796028256416321
0 references
0.7761001586914062
0 references
0.7735773921012878
0 references
