António Machiavelo

Orcid: 0000-0002-7595-7275

According to our database1, António Machiavelo authored at least 33 papers between 2004 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Location automata for regular expressions with shuffle and intersection.
Inf. Comput., December, 2023

On the average complexity of partial derivative transducers.
Theor. Comput. Sci., May, 2023

Location automata for synchronised shuffle expressions.
J. Log. Algebraic Methods Program., April, 2023

Average Complexity of Partial Derivatives for Synchronised Shuffle Expressions.
Proceedings of the Implementation and Application of Automata, 2023

2021
On the size of partial derivatives and the word membership problem.
Acta Informatica, 2021

Location Based Automata for Expressions with Shuffle.
Proceedings of the Language and Automata Theory and Applications, 2021

Partial Derivative Automaton by Compressing Regular Expressions.
Proceedings of the Descriptional Complexity of Formal Systems, 2021

On the Uniform Distribution of Regular Expressions.
Proceedings of the Descriptional Complexity of Formal Systems, 2021

2020
Guest Column: Analytic Combinatorics and Descriptional Complexity of Regular Languages on Average.
SIGACT News, 2020

On the Average State Complexity of Partial Derivative Transducers.
Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

2019
On Average Behaviour of Regular Expressions in Strong Star Normal Form.
Int. J. Found. Comput. Sci., 2019

2018
Position Automata for Semi-extended Expressions.
J. Autom. Lang. Comb., 2018

Automata for regular expressions with shuffle.
Inf. Comput., 2018

2017
On the Average Complexity of Partial Derivative Automata for Semi-extended Expressions.
J. Autom. Lang. Comb., 2017

On the Average Complexity of Strong Star Normal Form.
Proceedings of the Descriptional Complexity of Formal Systems, 2017

2016
Position Automaton Construction for Regular Expressions with Intersection.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

On the State Complexity of Partial Derivative Automata For Regular Expressions with Intersection.
Proceedings of the Descriptional Complexity of Formal Systems, 2016

2015
On the Number of Linear Finite Transducers.
Int. J. Found. Comput. Sci., 2015

Average Size of Automata Constructions from Regular Expressions.
Bull. EATCS, 2015

Partial Derivative Automaton for Regular Expressions with Shuffle.
Proceedings of the Descriptional Complexity of Formal Systems, 2015

2014
A Hitchhiker's Guide to descriptional complexity through analytic combinatorics.
Theor. Comput. Sci., 2014

On the invertibility of finite linear transducers.
RAIRO Theor. Informatics Appl., 2014

Counting Equivalent Linear Finite Transducers Using a Canonical Form.
Proceedings of the Implementation and Application of Automata, 2014

Statistical study on the number of injective linear finite transducers.
Proceedings of the Sixth Workshop on Non-Classical Models for Automata and Applications, 2014

On the Equivalence of Automata for KAT-expressions.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
On the Average Size of Glushkov and Equation Automata for KAT Expressions.
Proceedings of the Fundamentals of Computation Theory - 19th International Symposium, 2013

2012
On the Average Size of Glushkov and Partial derivative Automata.
Int. J. Found. Comput. Sci., 2012

Formal Power Series and the Invertibility of Finite Linear Transducers.
Proceedings of the Fourth Workshop on Non-Classical Models for Automata and Applications, 2012

2011
On the Average State Complexity of Partial derivative Automata: an analytic Combinatorics Approach.
Int. J. Found. Comput. Sci., 2011

The Average Transition Complexity of Glushkov and Partial Derivative Automata.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2010
On the Average Number of States of Partial Derivative Automata.
Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2007
Automated Ciphertext - Only Cryptanalysis of the Bifid Cipher.
Cryptologia, 2007

2004
Chebyshev polynomials over finite fields and reversibility of -automata on square grids.
Theor. Comput. Sci., 2004


  Loading...