Result Details

An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets

MEDUNA, A.; VRÁBEL, L.; ZEMEK, P. An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets. DCFS'12: 14th International Workshop on Descriptional Complexity of Formal Systems. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Braga: Springer Verlag, 2012. p. 236-243. ISBN: 978-3-642-31622-7. ISSN: 0302-9743.
Type
conference paper
Language
English
Authors
Meduna Alexandr, prof. RNDr., CSc., DIFS (FIT)
Vrábel Lukáš, Ing., DIFS (FIT)
Zemek Petr, Ing., Ph.D., DIFS (FIT)
Abstract

As its name suggests, a stateless pushdown automaton has no states. As a result, each of its computational steps depends only on the currently scanned symbol and the current pushdown-store top. In this paper, we consider stateless pushdown automata whose size of their pushdown alphabet is limited by a positive integer. More specifically, we establish an infinite hierarchy of language families resulting from stateless pushdown automata with limited pushdown alphabets. In addition, we prove analogous results for stateless deterministic pushdown automata and stateless real-time pushdown automata. A formulation of an open problem closes the paper.

Keywords


stateless pushdown automata, limited pushdown alphabets, generative power, infinite hierarchy of language families

URL
Published
2012
Pages
236–243
Journal
Lecture Notes in Computer Science, vol. 7386, ISSN 0302-9743
Proceedings
DCFS'12: 14th International Workshop on Descriptional Complexity of Formal Systems
Series
Lecture Notes in Computer Science
Conference
14th International Workshop on Descriptional Complexity of Formal Systems
ISBN
978-3-642-31622-7
Publisher
Springer Verlag
Place
Braga
DOI
10.1007/978-3-642-31623-4_18
BibTeX 
@inproceedings{BUT96942,
  author="Alexandr {Meduna} and Lukáš {Vrábel} and Petr {Zemek}",
  title="An Infinite Hierarchy of Language Families Resulting from Stateless Pushdown Automata with Limited Pushdown Alphabets",
  booktitle="DCFS'12: 14th International Workshop on Descriptional Complexity of Formal Systems",
  year="2012",
  series="Lecture Notes in Computer Science",
  journal="Lecture Notes in Computer Science",
  volume="7386",
  pages="236--243",
  publisher="Springer Verlag",
  address="Braga",
  doi="10.1007/978-3-642-31623-4\{_}18",
  isbn="978-3-642-31622-7",
  issn="0302-9743",
  url="http://www.springerlink.com/content/071345778vgw67tm/"
}
Projects
Advanced recognition and presentation of multimedia data, BUT, Vnitřní projekty VUT, FIT-S-11-2, start: 2011-01-01, end: 2013-12-31, completed
Centrum excelence IT4Innovations, MŠMT, Operační program Výzkum a vývoj pro inovace, ED1.1.00/02.0070, start: 2011-01-01, end: 2015-12-31, completed
Mathematical Foundations of Formal Language Theory, MŠMT, Fond rozvoje vysokých škol (FRVŠ), FR271/2012/G1, start: 2012-01-01, end: 2012-12-31, completed
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