Some decision problems concerning NPDAs, palindromes, and Dyck languages (Q5327495)
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 6196403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some decision problems concerning NPDAs, palindromes, and Dyck languages |
scientific article; zbMATH DE number 6196403 |
Statements
Some Decision Problems Concerning NPDAs, Palindromes, and Dyck Languages (English)
0 references
7 August 2013
0 references
context-free language (CFL)
0 references
nondeterministic pushdown automaton (NPDA)
0 references
counter acceptor
0 references
1-reversal counters
0 references
palindromes
0 references
Dyck language
0 references
decidable
0 references
undecidable
0 references
0.800029993057251
0 references
0.7982375621795654
0 references
0.7829713225364685
0 references
0.7822186946868896
0 references
0.7761040925979614
0 references
