| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Pál Dömösi, György Maróti |
On α 2 - ν 2-products of automata.  |
Acta Inf.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi, Szabolcs Iván (eds.) |
Automata and Formal Languages, 13th International Conference, AFL 2011, Debrecen, Hungary, August 17-22, 2011, Proceedings. |
AFL |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gemma Bel Enguix, Pál Dömösi, Alexander Krassovitskiy |
Parsing by Simple Insertion Systems. |
ICAART |
2010 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Géza Horváth, Laurent Vuillon |
On the Shyr-Yu theorem. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi |
Automata Networks without any Letichevsky Criteria. |
Automata, Formal Languages, and Related Topics |
2009 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Masami Ito, Solomon Marcus |
Marcus contextual languages consisting of primitive words. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi |
Automata Networks without any Letichevsky Criteria. |
LATA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Géza Horváth |
Alternative proof of the Lyndon-Schützenberger Theorem. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi, Manfred Kudlek |
New Iteration Lemmata for Regular Languages. |
Fundam. Inform. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Géza Horváth |
The Language of Primitive Words in not Regular: Two Simple Proofs. |
Bulletin of the EATCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Carlos Martín-Vide, Victor Mitrana |
Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages. |
Theory Is Forever |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi, Chrystopher L. Nehaniv, John L. Rhodes |
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi, Sándor Horváth, Masami Ito, Masashi Katsura |
Some Remarks on Primitive Words and Palindromes. |
DCFS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Satoshi Okawa |
A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages. |
Acta Cybern. |
2001 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Zoltán Ésik |
Homomorphic Simulation and Letichevsky's Criterion. |
Journal of Automata, Languages and Combinatorics |
2001 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi |
On Complete Classes of Directed Graphs. |
Words, Semigroups, and Transductions |
2001 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Masami Ito |
Multiple keyword patterns in context-free languages. |
Where Mathematics, Computer Science, Linguistics and Biology Meet |
2001 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi |
Unusual Algorithms for Lexicographical Enumeration. |
Acta Cybern. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Chrystopher L. Nehaniv |
On complete systems of automata. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi, Manfred Kudlek |
An Improvement of Iteration Lemmata for Context-free Languages. |
Words, Languages & Combinatorics |
2000 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Masami Ito |
A Parsing Problem for Context-Sensitive Languages. |
Words, Languages & Combinatorics |
2000 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Alexandru Mateescu |
On Slender Context-Free Languages. |
Recent Topics in Mathematical and Computational Linguistics |
2000 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Chrystopher L. Nehaniv |
Complete Finite Automata Network Graphs with Minimal Number of Edges. |
Acta Cybern. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Satoshi Okawa, Sadaki Hirose |
A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages. |
Bulletin of the EATCS |
1999 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Manfred Kudlek |
Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages. |
FCT |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi, Sándor Horváth, Masami Ito, László Kászonyi, Masashi Katsura |
Formal Languages Consisting of Primitive Words. |
FCT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi, Zoltán Ésik |
Product hierarchies of automata and homomorphic simulation. |
Acta Cybern. |
1990 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Zoltán Ésik, Balázs Imreh |
On Product Hierarchies of Automata. |
FCT |
1989 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Zoltán Ésik |
On the hiearchy of nui-product. |
Acta Cybern. |
1988 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Zoltán Ésik |
On homomorphic simulation of automata by alphai-producst. |
Acta Cybern. |
1988 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi, Zoltán Ésik |
Critical Classes for the alpha_0-Product. |
Theor. Comput. Sci. |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Ésik, Pál Dömösi |
Complete Classes of Automata for the alpha-0-Product. |
Theor. Comput. Sci. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh |
Homomorphic Realizations of Automata with Compositions. |
MFCS |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Pál Dömösi, Balázs Imreh |
On nui-products of automata. |
Acta Cybern. |
1983 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi |
On homomorphically alphai-complete systems of automata. |
Acta Cybern. |
1983 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi |
On minimal R-complete systems of finite automata. |
Acta Cybern. |
1977 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi |
On superpositions of automata. |
Acta Cybern. |
1976 |
DBLP BibTeX RDF |
|
| 1 | Pál Dömösi |
On the semigroup of automaton mappings with finite alphabet. |
Acta Cybern. |
1972 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")