(since 2007)
-
Two-Way Automata Making Choices Only at the Endmarkers.
6th International Conference on Language and Automata
Theory and Applications (LATA 2012), A Coruña,
Spain.
March 7th, 2012.
Full version
-
Parikh's Theorem and Descriptional Complexity.
38th International Conference on Current Trends
in Theory and Practice of Computer Science (SOFSEM 2012), Spindleruv Mlýn,
Czech Republic.
January 23th, 2012.
Full version
-
Two-way Unary Automata versus Logarithmic Space.
LIAFA, Paris, France.
December 9th, 2011.
Abstract
-
New Results Related to the Sakoda and Sipser
Question.
Institute of Computer Science,
P.J. Safarik University, Kosice, Slovakia.
November 7th, 2011.
Abstract
-
Risultati recenti intorno al problema di Sakoda e Sipser.
DSI, Milano.
October 20th, 2011.
Abstract
-
Descriptional Complexity and Regular Languages.
Modèles de Calcul,
Complexité & Combinatoire,
Laboratorie I3S, Université Nice
Sophia Antipolis
May 19th, 2011.
Abstract
-
Removing Nondeterminism from Two-Way Automata.
Invited talk at
Automata, Semigroups and Applications' days,
Porto, Portugal.
June 22th, 2010.
Abstract
-
Pairs of Complementary Unary Languages with
"Balanced" Nondeterministic Automata.
9th Latin American Symposium LATIN 2010:
Theoretical Informatics, Oaxaca, Mexico.
April 20th, 2010.
-
Converting Self-Verifying Automata into Deterministic
Automata.
3rd International Conference Language and Automata Theory and Applications, LATA 2009, Tarragona, Spain.
April 7th, 2009.
- Nondeterministic One-Tape Off-Line Turing Machines
ABCDays on List Automata, Forgetting Automata, and Restarting Automata, Prague.
March 28th, 2009.
-
Descriptional Complexity of Automata and Languages.
DICo/DSI, Milano.
December 10th, 2008.
-
Deterministic Pushdown
Automata and Unary Languages.
Mathematical Institute, Slovak Academy of Science, Kosice, Slovakia.
November 13th, 2008.
Abstract
-
Simulating Unary Context-Free Grammars and
Pushdown Automata with Finite Automata.
Institute of Computer Science, P.J. Safarik University, Kosice, Slovakia.
November 12th, 2008.
Abstract
-
Deterministic Pushdown
Automata and Unary Languages.
13th Conference on Implementation and
Application of Automata, CIAA 2008, San Francisco, California.
July 23th, 2008.
-
Eliminating the Nondeterminism from Two-Way Finite
Automata.
Institut für Informatik, Goethe Universität, Frankfurt am Main, Germany.
December 11th, 2007.
The page's WebCounter
count says that you are visitor number
since Nov 13, 2008
March 2012, Giovanni Pighizzini