BibTeX
CSL-JSON
MLA
Harvard
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata
release_xxrlca7pjjhujglpainm3duwhq
by
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki
Archived Files and Locations
application/pdf 384.7 kB
file_wz6ybabpuzgxlah7pazrqrlghy
|
web.archive.org (webarchive) pighizzini.di.unimi.it (web) homes.di.unimi.it (web) web.archive.org (webarchive) |
application/pdf 292.4 kB
file_nka4rxvru5bvpck3v3cfkhtl34
|
web.archive.org (webarchive) homes.di.unimi.it (web) |
application/pdf 224.6 kB
file_ujscqnan7zhp5fve333nikuypm
|
web.archive.org (webarchive) ictcs.di.unimi.it:80 (web) |
application/pdf 239.2 kB
file_qzjnqnzudfawvacmm7cm5o2joi
|
air.unimi.it (web) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
Type
Stage
Year 2012
chapter
Stage
published
Year 2012
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar