@incollection{LavadoPighizziniSeki:2014,
Author = {Lavado, Giovanna J. and Pighizzini, Giovanni and Seki, Shinnosuke},
BookTitle = {Descriptional Complexity of Formal Systems},
Editor = {J{\"u}rgensen, Helmut and Karhum{\"a}ki, Juhani and Okhotin, Alexander},
File = {Operational State Complexity under Parikh Equivalence - Lavado, Pighizzini, Seki (0) (0) - a - a - e.pdf},
ISBN = {978-3-319-09703-9},
Keywords = {state complexity; regular languages; Parikh equivalence; context-free grammars; semilinear sets},
Language = {English},
Pages = {294-305},
Publisher = {Springer International Publishing},
Series = {Lecture Notes in Computer Science},
Title = {Operational State Complexity under Parikh Equivalence},
URL = {http://dx.doi.org/10.1007/978-3-319-09704-6\_26},
Volume = {8614},
Year = {2014},
bdsk-url-1 = {http://dx.doi.org/10.1007/978-3-319-09704-6\_26},
date-added = {2015-11-23 15:28:11 +0000},
date-modified = {2015-11-23 15:28:11 +0000},
doi = {10.1007/978-3-319-09704-6_26}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A