"Construction of a Pushdown Automaton Accepting a Postfix Notation of a ..."

Tomás Pecka et al. (2018)

> Home

Details and statistics

DOI: 10.4230/OASICS.SLATE.2018.6

access: open

type: Conference or Workshop Paper

metadata version: 2024-05-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/slate/PeckaTPJ18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/slate/PeckaTPJ18
Tomás Pecka, Jan Trávnícek, Radomír Polách, Jan Janousek:
Construction of a Pushdown Automaton Accepting a Postfix Notation of a Tree Language Given by a Regular Tree Expression. SLATE 2018: 6:1-6:12

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.