Result Details

Parallel deep pushdown automata

SOLÁR, P. Parallel deep pushdown automata. Proceedings of the 18th Conference STUDENT EEICT 2012. vol. 3. Brno: Brno University of Technology, 2012. p. 410-414. ISBN: 978-80-214-4462-1.
Type
conference paper
Language
English
Authors
Solár Peter, Ing., DIFS (FIT)
Abstract
This paper presents parallel deep pushdown automata as a parallel version of the deep pushdown automata. The main difference is that parallel deep pushdown automaton can expand n topmost noninput pushdown symbols in only one move between two configurations. Like deep pushdown automata, parallel deep puhdown automata represents automaton counterpart to n-limited state grammars.
Keywords

parsing, pushdown automata, deep pushdown automata, parallel deep pushdown automata, state grammars

Published
2012
Pages
410–414
Proceedings
Proceedings of the 18th Conference STUDENT EEICT 2012
Series
vol. 3
Conference
Student EEICT 2012
ISBN
978-80-214-4462-1
Publisher
Brno University of Technology
Place
Brno
BibTeX 
@inproceedings{BUT192799,
  author="Peter {Solár}",
  title="Parallel deep pushdown automata",
  booktitle="Proceedings of the 18th Conference STUDENT EEICT 2012",
  year="2012",
  series="vol. 3",
  pages="410--414",
  publisher="Brno University of Technology",
  address="Brno",
  isbn="978-80-214-4462-1",
  url="https://www.fit.vut.cz/research/publication/9918/"
}
Files
Projects
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running
Research groups
Formal Model Research Group (RG FM)
Departments
Department of Information Systems (DIFS)
Back to top