Hirshfeld, Yoram, Moller, Faron (2001) Pushdown automata, multiset automata, and Petri nets. Theoretical Computer Science, 256 (1). 3-21 doi:10.1016/s0304-3975(00)00099-2

Library Home Bookshelves View by Type Using Search

Books Catalogs/Sales Lists Journals Reports Thesis/Dissertation Video

Search for Books Search for Journals Manage Subjects Statistics Books without DDC/LCC Top Unstructured Orphaned Articles

Bookshelves (DDC layout)Bookshelves (LCC layout)Visual Explorer DDC Treemap LCC Treemap DDC/LCC Crosswalk Classification Heatmap Latest Books

Advanced

Search inside 'Theoretical ...' only

- Only viewable:

Reference Type	Journal (article/letter/editorial)
Title	Pushdown automata, multiset automata, and Petri nets
Journal	Theoretical Computer Science
Authors	Hirshfeld, Yoram		Author
Authors	Moller, Faron		Author
Year	2001 (April)	Volume	256
Issue	1
Publisher	Elsevier BV
DOI	doi:10.1016/s0304-3975(00)00099-2Search in ResearchGate
	Generate Citation Formats
Mindat Ref. ID	6540482	Long-form Identifier	mindat:1:5:6540482:9
GUID	0
Full Reference	Hirshfeld, Yoram, Moller, Faron (2001) Pushdown automata, multiset automata, and Petri nets. Theoretical Computer Science, 256 (1). 3-21 doi:10.1016/s0304-3975(00)00099-2
Plain Text	Hirshfeld, Yoram, Moller, Faron (2001) Pushdown automata, multiset automata, and Petri nets. Theoretical Computer Science, 256 (1). 3-21 doi:10.1016/s0304-3975(00)00099-2
In	(2001) Theoretical Computer Science Vol. 256. Elsevier BV

	*Kutrib, Martin (1999) Pushdown cellular automata. Theoretical Computer Science, 215 (1). 239-261 doi:10.1016/s0304-3975(97)00187-4*
	Xu, Jianliang, Yoshinaga, Tsunehiro, Inoue, Katsushi, Wang, Yue, Ito, Akira (2001) Alternation for sublogarithmic space-bounded alternating pushdown automata. Theoretical Computer Science, 259 (1). 475-492 doi:10.1016/s0304-3975(00)00035-9
	*Dierks, Henning (2001) PLC-automata: a new class of implementable real-time automata. Theoretical Computer Science, 253 (1). 61-93 doi:10.1016/s0304-3975(00)00089-x*
	Champarnaud, J.-M. (2001) Subset construction complexity for homogeneous automata, position automata and ZPC-structures. Theoretical Computer Science, 267 (1). 17-34 doi:10.1016/s0304-3975(00)00293-0
	*Herzog, Christian (1997) Pushdown automata with bounded nondeterminism and bounded ambiguity. Theoretical Computer Science, 181 (1). 141-157 doi:10.1016/s0304-3975(96)00267-8*
	*Martin, Bruno (2001) A simulation of cellular automata on hexagons by cellular automata on rings. Theoretical Computer Science, 263 (1). 231-234 doi:10.1016/s0304-3975(00)00244-9*
	*Macarie, Ioan I., Ogihara, Mitsunori (1998) Properties of probabilistic pushdown automata. Theoretical Computer Science, 207 (1). 117-130 doi:10.1016/s0304-3975(98)00059-0*
	Hirshfeld, Yoram, Jerrum, Mark, Moller, Faron (1996) A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science, 158 (1). 143-159 doi:10.1016/0304-3975(95)00064-x
	*Dang, Zhe (2003) Pushdown timed automata: a binary reachability characterization and safety verification. Theoretical Computer Science, 302 (1). 93-121 doi:10.1016/s0304-3975(02)00743-0*
	*Câmpeanu, C., Sântean, N., Yu, S. (2001) Minimal cover-automata for finite languages. Theoretical Computer Science, 267 (1). 3-16 doi:10.1016/s0304-3975(00)00292-9*
	*Bertoni, Alberto, Carpentieri, Marco (2001) Analogies and differences between quantum and stochastic automata. Theoretical Computer Science, 262 (1). 69-81 doi:10.1016/s0304-3975(00)00154-7*

版权所有© mindat.org1993年至2026年，除了规定的地方。 Mindat.org全赖于全球数千个以上成员和支持者们的参与。
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
隐私政策 - 条款和条款细则 - 联络我们 - Report a bug/vulnerability Current server date and time: 2026.6.8 21:48:05

Go to top of page

Hirshfeld, Yoram, Moller, Faron (2001) Pushdown automata, multiset automata, and Petri nets. Theoretical Computer Science, 256 (1). 3-21 doi:10.1016/s0304-3975(00)00099-2

See Also