Result 1 to 20 of 278 total
On context-free languages of scattered words. (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, 142-153 (2012).
1
Algebraic synchronization trees and processes. (English)
Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9‒13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 30-41 (2012).
2
A context-free linear ordering with an undecidable first-order theory. (English)
Baeten, Jos C. M. (ed.) et al., Theoretical computer science. 7th IFIP TC 1/WG 2.2 international conference, TCS 2012, Amsterdam, The Netherlands, September 26‒28, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-33474-0/pbk). Lecture Notes in Computer Science 7604, 104-118 (2012).
3
Ordinal automata and Cantor normal form. (English)
Int. J. Found. Comput. Sci. 23, No. 1, 87-98 (2012).
4
Hausdorff rank of scattered context-free linear orders. (English)
Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16‒20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 291-302 (2012).
5
Free iterative and iteration $K$-semialgebras. (English)
Algebra Univers. 67, No. 2, 141-162 (2012).
6
On Müller context-free grammars. (English)
Theor. Comput. Sci. 416, 17-32 (2012).
7
The category of simulations for weighted tree automata. (English)
Int. J. Found. Comput. Sci. 22, No. 8, 1845-1859 (2011).
8
Stephen L. Bloom 1940-2010. (English)
Fundam. Inform. 109, No. 4, 369-381 (2011).
9
Kleene theorem in partial conway theories with applications. (English)
Kuich, Werner (ed.) et al., Algebraic foundations in computer science. Essays dedicated to Symeon Bozapalidis on the occasion of his retirement. Berlin: Springer (ISBN 978-3-642-24896-2/pbk). Lecture Notes in Computer Science 7020, 72-93 (2011).
10
Partial conway and iteration semiring-semimodule pairs. (English)
Kuich, Werner (ed.) et al., Algebraic foundations in computer science. Essays dedicated to Symeon Bozapalidis on the occasion of his retirement. Berlin: Springer (ISBN 978-3-642-24896-2/pbk). Lecture Notes in Computer Science 7020, 56-71 (2011).
11
Dagger extension theorem. (English)
Math. Struct. Comput. Sci. 21, No. 5, 1035-1066 (2011).
12
Scattered context-free linear orderings. (English)
Mauri, Giancarlo (ed.) et al., Developments in language theory. 15th international conference, DLT 2011, Milan, Italy, July 19‒22, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22320-4/pbk). Lecture Notes in Computer Science 6795, 216-227 (2011).
13
A unifying Kleene theorem for weighted finite automata. (English)
Calude, Cristian S. (ed.) et al., Rainbow of computer science. Dedicated to Hermann Maurer on the occasion of his 70th birthday. Berlin: Springer (ISBN 978-3-642-19390-3/pbk). Lecture Notes in Computer Science 6570, 76-89 (2011).
14
Context-free ordinals. (English)
Comput. Res. Repos. 2011, Article No. 1103.5421 (2011).
15
Multi-linear iterative K-sigma-semialgebras. (English)
Comput. Res. Repos. 2011, Article No. 1102.3106 (2011).
16
Residuated park theories. (English)
Comput. Res. Repos. 2011, Article No. 1102.1139 (2011).
17
Scattered context-free linear orderings. (English)
Comput. Res. Repos. 2011, Article No. 1102.0850 (2011).
18
Algebraic linear orderings. (English)
Int. J. Found. Comput. Sci. 22, No. 2, 491-515 (2011).
19
Büchi context-free languages. (English)
Theor. Comput. Sci. 412, No. 8-10, 805-821 (2011).
20
Result 1 to 20 of 278 total
Start
Contact
Print
General Help
