A New Algorithm for the Determinisation of Visibly Pushdown Automata
Saved in:
| Main Authors: | Radomír Polách, Jan Travniček, Jan Janoušek, Bořivoj Melichar |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Information Processing Society
2015-10-01
|
| Series: | Annals of computer science and information systems |
| Online Access: | https://annals-csis.org/Volume_5/pliks/325.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Verification of Opacity and Diagnosability for Pushdown Systems
by: Koichi Kobayashi, et al.
Published: (2013-01-01) -
Study on Progressive Collapse Behavior of SRC Column-Steel Beam Hybrid Frame Based on Pushdown Analysis
by: Liusheng Chu, et al.
Published: (2017-01-01) -
Automata and computability /
by: Kozen, Dexter C.
Published: (1997) -
Degeneralization Algorithm for Generation of Büchi Automata Based on Contented Situation
by: Laixiang Shan, et al.
Published: (2015-01-01) -
FRAM—The Robotic Telescope for the Monitoring of the Wavelength Dependence of the Extinction: Description of Hardware, Data Analysis, and Results
by: Michael Prouza, et al.
Published: (2010-01-01)