Pál Dömösi

According to our database1, Pál Dömösi
  • authored at least 43 papers between 1972 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Statistical Analysis of DH1 Cryptosystem.
Acta Cybern., 2017

2016
On Chomsky Hierarchy of Palindromic Languages.
Acta Cybern., 2016

2015
A Novel Cryptosystem Based on Gluskov Product of Automata.
Acta Cybern., 2015

2014
Some Results on Bounded Context-Free Languages.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2012
Preface.
Int. J. Found. Comput. Sci., 2012

2011
On α 2 - ν 2-products of automata.
Acta Inf., 2011

2010
Parsing by Simple Insertion Systems.
Proceedings of the ICAART 2010 - Proceedings of the International Conference on Agents and Artificial Intelligence, Volume 2, 2010

2009
On the Shyr-Yu theorem.
Theor. Comput. Sci., 2009

Automata Networks without any Letichevsky Criteria.
Proceedings of the Automata, Formal Languages, and Related Topics, 2009

2008
Marcus contextual languages consisting of primitive words.
Discrete Mathematics, 2008

2007
Automata Networks without any Letichevsky Criteria.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006
Alternative proof of the Lyndon-Schützenberger Theorem.
Theor. Comput. Sci., 2006

2005
New Iteration Lemmata for Regular Languages.
Fundam. Inform., 2005

The Language of Primitive Words in not Regular: Two Simple Proofs.
Bulletin of the EATCS, 2005

2004
Remarks on Sublanguages Consisting of Primitive Words of Slender Regular and Context-Free Languages.
Proceedings of the Theory Is Forever, 2004

2003
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
Theor. Comput. Sci., 2003

Some Remarks on Primitive Words and Palindromes.
Proceedings of the 5th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2003, Budapest, Hungary, July 12, 2003

2001
Homomorphic Simulation and Letichevsky's Criterion.
Journal of Automata, Languages and Combinatorics, 2001

A Chomsky-Schützenberger-Stanley Type Characterization of the Class of Slender Context-Free Languages.
Acta Cybern., 2001

Multiple keyword patterns in context-free languages.
Proceedings of the Where Mathematics, 2001

On Complete Classes of Directed Graphs.
Proceedings of the Words, Semigroups, and Transductions, 2001

2000
On complete systems of automata.
Theor. Comput. Sci., 2000

Unusual Algorithms for Lexicographical Enumeration.
Acta Cybern., 2000

An Improvement of Iteration Lemmata for Context-free Languages.
Proceedings of the International Colloquium on Words, 2000

A Parsing Problem for Context-Sensitive Languages.
Proceedings of the International Colloquium on Words, 2000

On Slender Context-Free Languages.
Proceedings of the Recent Topics in Mathematical and Computational Linguistics, 2000

1999
A Chomsky and Stanley Type Homomorphic Characterization of the Class of Linear Languages.
Bulletin of the EATCS, 1999

Complete Finite Automata Network Graphs with Minimal Number of Edges.
Acta Cybern., 1999

Strong Iteration Lemmata for Regular, Linear, Context-Free, and Linear Indexed Languages.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1996
A New Pumping Property of Context-Free Language.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1993
Formal Languages Consisting of Primitive Words.
Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1990
Product hierarchies of automata and homomorphic simulation.
Acta Cybern., 1990

1989
On Product Hierarchies of Automata.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
Critical Classes for the alpha_0-Product.
Theor. Comput. Sci., 1988

On homomorphic simulation of automata by α0-products.
Acta Cybern., 1988

On the hierarchy of νi-product.
Acta Cybern., 1988

1986
Complete Classes of Automata for the alpha-0-Product.
Theor. Comput. Sci., 1986

Homomorphic Realizations of Automata with Compositions.
Proceedings of the Mathematical Foundations of Computer Science 1986, 1986

1983
On νi-products of automata.
Acta Cybern., 1983

On homomorphically αi-complete systems of automata.
Acta Cybern., 1983

1976
On minimal R-complete systems of finite automata.
Acta Cybern., 1976

On superpositions of automata.
Acta Cybern., 1976

1972
On the semigroup of automaton mappings with finite alphabet.
Acta Cybern., 1972


  Loading...