Result 1 to 20 of 395 total
Superiority of one-way and realtime quantum machines $^{\ast,\ast\ast}$. (English)
RAIRO, Theor. Inform. Appl. 46, No. 4, 615-641 (2012).
1
Data exchange in Datalog is mainly a matter of choice. (English)
Barceló, Pablo (ed.) et al., Datalog in academia and industry. Second international workshop, Datalog 2.0, Vienna, Austria, September 11‒13, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32924-1/pbk). Lecture Notes in Computer Science 7494, 153-164 (2012).
2
State complexity and limited nondeterminism. (English)
Kutrib, Martin (ed.) et al., Descriptional complexity of formal systems. 14th international workshop, DCFS 2012, Braga, Portugal, July 23‒25, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31622-7/pbk). Lecture Notes in Computer Science 7386, 252-265 (2012).
3
Determinism vs. nondeterminism for two-way automata. Representing the meaning of states by logical formulæ. (English)
Yen, Hsu-Chun (ed.) et al., Developments in language theory. 16th international conference, DLT 2012, Taipei, Taiwan, August 14-17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31652-4/pbk). Lecture Notes in Computer Science 7410, 24-39 (2012).
4
Undecidability of state complexities using mirror images. (English)
Bordihn, Henning (ed.) et al., Languages alive. Essays dedicated to Jürgen Dassow on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-31643-2/pbk). Lecture Notes in Computer Science 7300, 221-235 (2012).
5
Descriptional complexity of input-driven pushdown automata. (English)
Bordihn, Henning (ed.) et al., Languages alive. Essays dedicated to Jürgen Dassow on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-31643-2/pbk). Lecture Notes in Computer Science 7300, 186-206 (2012).
6
Automata with modulo counters and nondeterministic counter bounds. (English)
Moreira, Nelma (ed.) et al., Implementation and application of automata. 17th international conference, CIAA 2012, Porto, Portugal, July 17‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31605-0/pbk). Lecture Notes in Computer Science 7381, 361-368 (2012).
7
In memoriam Chandra Kintala. (English)
Int. J. Found. Comput. Sci. 23, No. 1, 5-19 (2012).
8
On multi-head automata with restricted nondeterminism. (English)
Inf. Process. Lett. 112, No. 14-15, 572-577 (2012).
9
Tensor rank and strong quantum nondeterminism in multiparty communication. (English)
Agrawal, Manindra (ed.) et al., Theory and applications of models of computation. 9th annual conference, TAMC 2012, Beijing, China, May 16‒21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29951-3/pbk). Lecture Notes in Computer Science 7287, 400-411 (2012).
10
Mirror images and schemes for the maximal complexity of nondeterminism. (English)
Fundam. Inform. 116, No. 1-4, 237-249 (2012).
11
Computation as an unbounded process. (English)
Theor. Comput. Sci. 429, 202-212 (2012).
12
Unambiguous functions in logarithmic space. (English)
Fundam. Inform. 114, No. 2, 129-147 (2012).
13
A relational semantics for parallelism and non-determinism in a functional setting. (English)
Ann. Pure Appl. Logic 163, No. 7, 918-934 (2012).
14
A bialgebraic approach to automata and formal language theory. (English)
Ann. Pure Appl. Logic 163, No. 7, 745-762 (2012).
15
Improved simulation of nondeterministic Turing machines. (English)
Theor. Comput. Sci. 417, 66-73 (2012).
16
A category theoretic view of nondeterministic recursive program schemes. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 496-511, electronic only (2011).
17
Ambiguity of unary symmetric difference NFAs. (English)
Cerone, Antonio (ed.) et al., Theoretical aspects of computing ‒ ICTAC 2011. 8th international colloquium, Johannesburg, South Africa, August 31‒September 2, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23282-4/pbk). Lecture Notes in Computer Science 6916, 256-266 (2011).
18
Transformations between different models of unranked bottom-up tree automata. (English)
Fundam. Inform. 109, No. 4, 405-424 (2011).
19
On the correctness of pull-tabbing. (English)
Theory Pract. Log. Program. 11, No. 4-5, 713-730 (2011).
20
Result 1 to 20 of 395 total
Start
Contact
Print
General Help
