


default search action
Information and Computation, Volume 237
Volume 237, October 2014
- Vojtech Forejt, Petr Jancar

, Stefan Kiefer, James Worrell
:
Language equivalence of probabilistic pushdown automata. 1-11 - Diego Calvanese

, Thomas Eiter, Magdalena Ortiz
:
Answering regular path queries in expressive Description Logics via alternating tree-automata. 12-55 - Artur Jez

, Alexander Okhotin
:
Computational completeness of equations over sets of natural numbers. 56-94 - Yung-Hsing Peng, Chang-Biau Yang:

Finding the gapped longest common subsequence by incremental suffix maximum queries. 95-100 - Yuri Kalnishkan

, Michael V. Vyugin, Vladimir Vovk
:
Generalised entropies and asymptotic complexities of languages. 101-141 - Michael Brand

:
Constant-time sorting. 142-150 - Johann Schuster, Markus Siegle

:
Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states. 151-173 - Frank Stephan

, Jason Teutsch:
Things that can be made into themselves. 174-186 - Roberto Giacobazzi, Francesco Ranzato:

Correctness kernels of abstract interpretations. 187-203 - Petr A. Golovach

, Daniël Paulusma
, Jian Song:
Closing complexity gaps for coloring problems on H-free graphs. 204-214 - Domenico Cantone

, Pietro Ursino
:
Formative processes with applications to the decision problem in set theory: II. Powerset and singleton operators, finiteness predicate. 215-242 - Emilie Charlier, Juha Honkala:

The freeness problem over matrix semigroups and bounded languages. 243-256 - Zuzana Bednárová, Viliam Geffert, Carlo Mereghetti

, Beatrice Palano
:
Removing nondeterminism in constant height pushdown automata. 257-267 - Mikhail Barash, Alexander Okhotin

:
An extension of context-free grammars with one-sided context specifications. 268-293 - Martin Kutrib

, Andreas Malcher
, Giovanni Pighizzini
:
Oblivious two-way finite automata: Decidability and complexity. 294-302

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














