Alessandra Cherubini

According to our database1, Alessandra Cherubini authored at least 42 papers between 1988 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Theoretical Computer Science in Italy.
Theor. Comput. Sci., 2021

2020
Some completely semisimple HNN-extensions of inverse semigroups.
Int. J. Algebra Comput., 2020

2017
Composing short 3-compressing words on a 2-letter alphabet.
Discret. Math. Theor. Comput. Sci., 2017

2016
Recognizing 3-collapsing words over a binary alphabet.
Theor. Comput. Sci., 2016

2014
Binary 3-compressible automata.
Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013
Expressiveness and complexity of regular pure two-dimensional context-free languages.
Int. J. Comput. Math., 2013

2011
Multilinear Equations in Amalgams of Finite Inverse Semigroups.
Int. J. Algebra Comput., 2011

A unifying approach to picture grammars.
Inf. Comput., 2011

On Some Classes of 2D Languages and Their Relations.
Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

Short 3-Collapsing Words over a 2-Letter Alphabet.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2009
Collapsing words, permutation conditions and coherent colorings of trees.
Theor. Comput. Sci., 2009

On the length of shortest 2-collapsing words.
Discret. Math. Theor. Comput. Sci., 2009

Alphabetical Satisfiability Problem for Trace Equations.
Acta Cybern., 2009

Picture Languages: From Wang Tiles to 2D Grammars.
Proceedings of the Algebraic Informatics, Third International Conference, 2009

2008
Regional Languages and Tiling: A Unifying Approach to Picture Grammars.
Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

NP-completeness of the alphabetical satisfiability problem for trace equations.
Proceedings of the Automata and Formal Languages, 12th International Conference, 2008

2007
Generalizing T-Conorms to Face Saturation in Mamdani Fuzzy Inference Systems.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2007

Regular Languages and Associative Language Descriptions.
Discret. Math. Theor. Comput. Sci., 2007

Development of a multimode navigation system for an assistive robotics project.
Proceedings of the 2007 IEEE International Conference on Robotics and Automation, 2007

2006
Picture languages: Tiling systems versus tile rewriting grammars.
Theor. Comput. Sci., 2006

A Combinatorial Approach to Collapsing Words.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Recognizing Collapsing Words is co-NP-Complete.
Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

The ASPICE project: inclusive design for the motor disabled.
Proceedings of the working conference on Advanced visual interfaces, 2006

2005
A Complete Formulation of Generalized Affine Equivalence.
Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

A formal approach supporting the specification and verification of business conversation requirements.
Proceedings of the AC 2005, 2005

2004
Timing in the Cospan-Span Model.
Electron. Notes Theor. Comput. Sci., 2004

On the Generalized Linear Equivalence of Functions Over Finite Fields.
Proceedings of the Advances in Cryptology, 2004

2003
Image reducing words and subgroups of free groups.
Theor. Comput. Sci., 2003

2002
Associative language descriptions.
Theor. Comput. Sci., 2002

An Inverse Automata Algorithm for Recognizing 2-Collapsing Words.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
Some Structural Properties of Associative Language Descriptions.
Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000
Tree Adjoining Languages and Multipushdown Languages.
Theory Comput. Syst., 2000

1999
Modeling Operating Systems Schedulers with Multi-Stack-Queue Grammars.
Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1996
A Polynomial-Time Parsing Algorithm for K-Depth Languages.
J. Comput. Syst. Sci., 1996

Multi-Push-Down Languages and Grammars.
Int. J. Found. Comput. Sci., 1996

1995
Deterministic Parsing for Augmented Context-free Grammars.
Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1993
Fair First Languages and Parallel Programme Schemes.
Proceedings of the Developments in Language Theory, 1993

1992
Real-Time Scheduling by Queue Automata.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1992

1991
QRT FIFO Automata, Breath-First Grammars and Their Relations.
Theor. Comput. Sci., 1991

1990
Breath and Depth Grammars and Deque Automata.
Int. J. Found. Comput. Sci., 1990

1989
An Integrated Expert-System Builder.
IEEE Softw., 1989

1988
Breadth-First Phrase Structure Grammars and Queue Automata.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988


  Loading...