State complexity of basic language operations combined with reversal (original) (raw)

State Complexity of Basic Operations on Non-returning Regular Languages

Galina Jiraskova

Lecture Notes in Computer Science, 2013

View PDFchevron_right

On the state complexity of reversals of regular languages

Arto Salomaa

2004

View PDFchevron_right

Incomplete Transition Complexity of Basic Operations on Finite Languages

Rogerio Reis

Lecture Notes in Computer Science, 2013

View PDFchevron_right

State complexity of some operations on binary regular languages

Galina Jiraskova

Theoretical Computer Science, 2005

View PDFchevron_right

State Complexity of Basic Operations Combined with Reversal

Guangwu Liu

2007

View PDFchevron_right

Incomplete operational transition complexity of regular languages

Nelma Moreira

Information and Computation, 2015

View PDFchevron_right

The Operational Incomplete Transition Complexity on Finite Languages

Nelma Moreira

2013

View PDFchevron_right

A Review on State Complexity of Individual Operations

Nelma Moreira

View PDFchevron_right

On the State Complexity of the Reverse of mathcalR{\mathcal R}mathcalR - and mathcalJ{\mathcal J}mathcalJ -Trivial Regular Languages

Galina Jiraskova

Lecture Notes in Computer Science, 2013

View PDFchevron_right

A Survey on Operational State Complexity

Nelma Moreira

arXiv (Cornell University), 2015

View PDFchevron_right

Complexity in Prefix-Free Regular Languages

Galina Jiraskova

Computing Research Repository, 2010

View PDFchevron_right

Incomplete transition complexity of some basic operations

Nelma Moreira

2013

View PDFchevron_right

On inverse operations and their descriptional complexity

Carlo Mereghetti

View PDFchevron_right

The Range of State Complexities of Languages Resulting from the Cut Operation

Michal Hospodár

2019

View PDFchevron_right

Estimation of state complexity of combined operations

Guangwu Liu

Theoretical Computer Science, 2009

View PDFchevron_right

Reversal of binary regular languages

Galina Jiraskova

Theoretical Computer Science, 2012

View PDFchevron_right

On the State Complexity of Operations on Two-Way Finite Automata

Galina Jiraskova

Developments in Language Theory

View PDFchevron_right

Quotient Complexity of Bifix-, Factor, and Subword-Free Regular Languages

Galina Jiraskova

2010

View PDFchevron_right

Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language

Galina Jiraskova

Acta Cybernetica, 2014

View PDFchevron_right

Decimations of languages and state complexity

Avery Miller

Theoretical Computer Science, 2009

View PDFchevron_right

The Complexity of Languages Resulting from the Concatenation Operation

Galina Jiraskova

Lecture Notes in Computer Science, 2016

View PDFchevron_right

Quotient Complexity of Closed Languages

Galina Jiraskova

Theory of Computing Systems, 2013

View PDFchevron_right

On the State Complexity of the Shuffle of Regular Languages

Galina Jiraskova

Lecture Notes in Computer Science, 2016

View PDFchevron_right

On a structural property in the state complexity of projected regular languages

Galina Jiraskova

Theoretical Computer Science, 2012

View PDFchevron_right

Complexity of regular bifix-free languages

Robert Ferens

2017

View PDFchevron_right

Quotient Complexity of Bifix-, Factor, and Subword-Free Languages

Galina Jiraskova

Computing Research Repository, 2010

View PDFchevron_right

Complexity of Operations on Cofinite Languages

Laura Giambruno

Lecture Notes in Computer Science, 2010

View PDFchevron_right

The Average State Complexity of Rational Operations on Finite Languages

Laura Giambruno

International Journal of Foundations of Computer Science, 2010

View PDFchevron_right