BibSonomy :: author :: Dömösi ::

tag user group author concept BibTeX key search:all

The blue social bookmark and publication sharing system.

bookmarks

bookmarks per page: 5 10 20 50 100

RSS BibTeX RDF more

publications

(37)

<< < 1 | 2 > >>

Multiple keyword patterns in context-free languages.
Pál Dömösi, and Masami Ito Where Mathematics, Computer Science, Linguistics and Biology Meet, page 237-241. Kluwer Academic Publishers, (2001)
to dblp by dblp on Dec 9, 2011, 12:00 AM
URL | BibTeX
A Parsing Problem for Context-Sensitive Languages.
Pál Dömösi, and Masami Ito Words, Languages & Combinatorics, page 183-184. World Scientific, (2000)
to dblp by dblp on Dec 8, 2011, 12:00 AM
URL | BibTeX
An Improvement of Iteration Lemmata for Context-free Languages.
Pál Dömösi, and Manfred Kudlek Words, Languages & Combinatorics, page 185-191. World Scientific, (2000)
to dblp by dblp on Dec 8, 2011, 12:00 AM
URL | BibTeX
On α 2 - ν 2-products of automata.
Pál Dömösi, and György Maróti Acta Inf. 48(7-8):397-408 (2011)
to dblp by dblp on Nov 25, 2011, 12:00 AM
URL | BibTeX
Automata Networks without any Letichevsky Criteria.
Pál Dömösi LATA, Report 35/07, page 237-248. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona, (2007)
to dblp by dblp on Nov 7, 2011, 12:00 AM
URL | BibTeX
Some Remarks on Primitive Words and Palindromes.
Pál Dömösi, Sándor Horváth, Masami Ito, and Masashi Katsura DCFS, page 245-254. MTA SZTAKI, Hungarian Academy of Sciences, Budapest, Hungary, (2003)
to dblp by dblp on Oct 23, 2011, 12:00 AM
URL | BibTeX
New Iteration Lemmata for Regular Languages.
Pál Dömösi, and Manfred Kudlek Fundam. Inform. 64(1-4):151-157 (2005)
to dblp by dblp on Sep 12, 2011, 12:00 AM
URL | BibTeX
Complete Classes of Automata for the alpha-0-Product.
Zoltán Ésik, and Pál Dömösi Theor. Comput. Sci. 47(3):1-14 (1986)
to dblp by dblp on Sep 7, 2011, 12:00 AM
URL | BibTeX
Critical Classes for the alpha_0-Product.
Pál Dömösi, and Zoltán Ésik Theor. Comput. Sci. (1988)
to dblp by dblp on Sep 7, 2011, 12:00 AM
URL | BibTeX
Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages.
Pál Dömösi, Carlos Martín-Vide, and Victor Mitrana Theory Is Forever, volume 3113 of Lecture Notes in Computer Science, page 60-67. Springer, (2004)
to dblp by dblp on Jul 7, 2011, 12:00 AM
URL | BibTeX
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages.
Pál Dömösi, and Manfred Kudlek FCT, volume 1684 of Lecture Notes in Computer Science, page 226-233. Springer, (1999)
to dblp by dblp on Jun 20, 2011, 12:00 AM
URL | BibTeX
Parsing by Simple Insertion Systems.
Gemma Bel Enguix, Pál Dömösi, and Alexander Krassovitskiy ICAART 2, page 383-387. INSTICC Press, (2010)
to dblp by dblp on Jun 7, 2011, 12:00 AM
URL | BibTeX
On the Shyr-Yu theorem.
Pál Dömösi, Géza Horváth, and Laurent Vuillon Theor. Comput. Sci. 410(47-49):4874-4877 (2009)
to dblp by dblp on Dec 29, 2009, 12:00 AM
URL | BibTeX
Homomorphic Realizations of Automata with Compositions.
Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, and J. Virágh MFCS, volume 233 of Lecture Notes in Computer Science, page 299-307. Springer, (1986)
to dblp by dblp on Sep 21, 2009, 12:00 AM
URL | BibTeX
Automata Networks without any Letichevsky Criteria.
Pál Dömösi Automata, Formal Languages, and Related Topics, page 39-54. Institute of Informatics, University of Szeged, Hungary, (2009)
to dblp by dblp on May 17, 2009, 12:00 AM
URL | BibTeX
Marcus contextual languages consisting of primitive words.
Pál Dömösi, Masami Ito, and Solomon Marcus Discrete Mathematics 308(21):4877-4881 (2008)
to dblp by dblp on Jan 20, 2009, 12:00 AM
URL | BibTeX
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
Pál Dömösi, Chrystopher L. Nehaniv, and John L. Rhodes Theor. Comput. Sci. 302(1-3):295-317 (2003)
to dblp by dblp on Aug 24, 2007, 12:00 AM
URL | BibTeX
Alternative proof of the Lyndon-Schützenberger Theorem.
Pál Dömösi, and Géza Horváth Theor. Comput. Sci. 366(3):194-198 (2006)
to dblp by dblp on Nov 21, 2006, 12:00 AM
URL | BibTeX
On Slender Context-Free Languages.
Pál Dömösi, and Alexandru Mateescu Recent Topics in Mathematical and Computational Linguistics, page 97-103. Editura Academiei Româe, Bucuresti, (2000)
to dblp by dblp on Mar 14, 2006, 12:00 AM
URL | BibTeX
On Complete Classes of Directed Graphs.
Pál Dömösi Words, Semigroups, and Transductions, page 69-79. World Scientific, (2001)
to dblp by dblp on Mar 14, 2006, 12:00 AM
URL | BibTeX

<< < 1 | 2 > >>publications per page: 5 10 20 50 100