"Converting nondeterministic automata and context-free grammars into Parikh ..."

Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki (2013)

> Home

Details and statistics

DOI: 10.1016/J.IC.2013.06.003

access: open

type: Journal Article

metadata version: 2024-12-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/iandc/LavadoPS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/iandc/LavadoPS13
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki:
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata. Inf. Comput. 228: 1-15 (2013)

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.