Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata release_xxrlca7pjjhujglpainm3duwhq

by Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

2012   p284-295

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  chapter
Stage   published
Year   2012
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f6984d96-cb7e-4d6b-8c57-813c97ce01b4
API URL: JSON