Stop the war!
Остановите войну!
for scientists:
default search action
Theoretical Computer Science, Volume 679
Volume 679, May 2017
- Frank Drewes:
Preface. 1
- Andreas Maletti:
Survey: Finite-state technology in natural language processing. 2-17 - Hermann Gruber, Markus Holzer, Sebastian Jakobi:
More on deterministic and nondeterministic finite cover automata. 18-30 - Henning Fernau, Meenakshi Paramasivan, Markus L. Schmid, Vojtech Vorel:
Characterization and complexity results on jumping finite automata. 31-52 - Mehryar Mohri, Michael D. Riley:
A disambiguation algorithm for weighted automata. 53-68 - Martin Berglund, Brink van der Merwe:
On the semantics of regular expression parsing in the wild. 69-82 - Martin Kutrib, Matthias Wendlandt:
Concatenation-free languages. 83-94 - Pascal Caron, Ludovic Mignot, Clément Miklarz:
On the hierarchy of generalizations of one-unambiguous regular languages. 95-106 - Timothy Ng, David Rappaport, Kai Salomaa:
State complexity of prefix distance. 107-117 - Daniel Prusa, Klaus Reinhardt:
Undecidability of the emptiness problem for context-free picture languages. 118-125 - Abhijin Adiga, Chris J. Kuhlman, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Inferring local transition functions of discrete dynamical systems from observations of system behavior. 126-144 - Stefan Hoffmann, Sibylle Schwarz, Ludwig Staiger:
Shift-invariant topologies for the Cantor space Xω. 145-161
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.