Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Shinnosuke Seki

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Giovanni Pighizzini

> Home > Persons > Shinnosuke Seki

Publications

2014
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/dcfs/LavadoPS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dcfs/LavadoPS14
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki:
Operational State Complexity under Parikh Equivalence. DCFS 2014: 294-305
2013
[j19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  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)
2012
[c17]
- view
  authority control:
- export record
  dblp key:
  - conf/dlt/LavadoPS12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dlt/LavadoPS12
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki:
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent Deterministic Automata. Developments in Language Theory 2012: 284-295
[i11]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1212-1346
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1212-1346
Giovanna J. Lavado, Giovanni Pighizzini, Shinnosuke Seki:
Converting Nondeterministic Automata and Context-Free Grammars into Parikh Equivalent One-Way and Two-Way Deterministic Automata. CoRR abs/1212.1346 (2012)

a service of

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.