Sheng Yu

Int. J. Comput. Math., 2013

2012

Statecharts.

[BibT_eX]

[DOI]

Hanlin Lu

Proceedings of the Handbook of Finite State Based Models and Applications., 2012

State complexity of union and intersection of square and reversal on k regular languages.

[BibT_eX]

[DOI]

Lila Kari

Theor. Comput. Sci., 2012

State complexity of union and intersection of star on k regular languages.

[BibT_eX]

[DOI]

Lila Kari

Theor. Comput. Sci., 2012

State complexity of combined operations with two basic operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

State Complexity and Approximation.

[BibT_eX]

[DOI]

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

State Complexity of Two Combined Operations: Catenation-Star and Catenation-Reversal.

[BibT_eX]

[DOI]

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

State Complexity of Combined Operations with Union, Intersection, Star and Reversal.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

Derivatives of Regular Expressions and an Application.

[BibT_eX]

[DOI]

Haiming Chen

Proceedings of the Computation, Physics and Beyond, 2012

2011

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

State Complexity of Two Combined Operations: Catenation-Union and Catenation-Intersection.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Transition Complexity of Incomplete DFAs.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2011

Derick Wood: Always in Our Hearts.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2011

Undecidability of the State Complexity of Composed Regular Operations.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

State Complexity Research and Approximation.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

State Complexity of Four Combined Operations Composed of Union, Intersection, Star and Reversal.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2011

2010

Seventy Years Derick Wood.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2010

Subword Occurrences, Parikh Matrices and Lyndon Images.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

On implementing recognizable transductions.

[BibT_eX]

[DOI]

Stavros Konstantinidis

Int. J. Comput. Math., 2010

State Complexity of Catenation Combined with Star and Reversal

[BibT_eX]

[DOI]

Proceedings of the Proceedings Twelfth Annual Workshop on Descriptional Complexity of Formal Systems, 2010

State Complexity of Two Combined Operations: Reversal-Catenation and Star-Catenation

[BibT_eX]

[DOI]

CoRR, 2010

State complexity of union and intersection combined with star and reversal

[BibT_eX]

[DOI]

CoRR, 2010

State Complexity of Catenation Combined with Union and Intersection.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2010

2009

Deciding determinism of caterpillar expressions.

[BibT_eX]

[DOI]

Jinfeng Zan

Theor. Comput. Sci., 2009

Hierarchy and equivalence of multi-letter quantum finite automata.

[BibT_eX]

[DOI]

Daowen Qiu

Theor. Comput. Sci., 2009

Estimation of state complexity of combined operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Variants of codes and indecomposable languages.

[BibT_eX]

[DOI]

Inf. Comput., 2009

State Complexity Approximation

[BibT_eX]

[DOI]

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Are Statecharts Finite Automata?

[BibT_eX]

[DOI]

Hanlin Lu

Proceedings of the Implementation and Application of Automata, 2009

State Complexity of Combined Operations for Prefix-Free Regular Languages.

[BibT_eX]

[DOI]

Yo-Sub Han

Proceedings of the Language and Automata Theory and Applications, 2009

2008

State complexity of basic language operations combined with reversal.

[BibT_eX]

[DOI]

Inf. Comput., 2008

The State Complexity of Two Combined Operations: Star of Catenation and Star of Reversal.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2008

Length Codes, Products of Languages and Primality.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2008

2007

State complexity of combined operations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

On the existence of prime decompositions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

A Family of NFAs Free of State Reductions.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2007

Sc-Expressions in Object-Oriented Languages.

[BibT_eX]

[DOI]

Qing Zhao

Int. J. Found. Comput. Sci., 2007

On the State Complexity of Combined Operations and their Estimation.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Fuzzification of Rational and Recognizable Sets.

[BibT_eX]

[DOI]

Stavros Konstantinidis

Fundam. Informaticae, 2007

Cover Automata for Finite Language.

[BibT_eX]

Bull. EATCS, 2007

Representation and uniformization of algebraic transductions.

[BibT_eX]

[DOI]

Stavros Konstantinidis

Acta Informatica, 2007

Deterministic Caterpillar Expressions.

[BibT_eX]

[DOI]

Jinfeng Zan

Proceedings of the Implementation and Application of Automata, 2007

State Complexity of Basic Operations Combined with Reversal.

[BibT_eX]

Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006

Subword conditions and subword histories.

[BibT_eX]

[DOI]

Inf. Comput., 2006

Nondeterministic Bimachines and Rational Relations with Finite Codomain.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2006

On the State Complexity of Combined Operations.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2006

On Weakly Ambiguous Finite Transducers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

State Complexity of Catenation and Reversal Combined with Star.

[BibT_eX]

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2005

Mergible states in large NFA.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

State Complexity: Recent Results and Open Problems.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2005

Type Theory and Language Constructs for Objects with States.

[BibT_eX]

[DOI]

Haitong Xu

Proceedings of the First International Workshop on Developments in Computational Models, 2005

Adding States into Object Types.

[BibT_eX]

Haitong Xu

Proceedings of The 2005 International Conference on Programming Languages and Compilers, 2005

Large NFA Without Mergeable States.

[BibT_eX]

Proceedings of the 7th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2005, Como, Italy, June 30, 2005

Reducing the Size of NFAs by Using Equivalences and Preorders.

[BibT_eX]

[DOI]

Roberto Solis-Oba

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2004

On the state complexity of reversals of regular languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Subword histories and Parikh matrices.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2004

Pattern expressions and pattern automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Word Complexity And Repetitions In Words.

[BibT_eX]

[DOI]

Kaizhong Zhang

Int. J. Found. Comput. Sci., 2004

Process Traces With the Option Operation.

[BibT_eX]

Qing Zhao

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

On NFA Reductions.

[BibT_eX]

[DOI]

Gonzalo Navarro

Proceedings of the Theory Is Forever, 2004

2003

Reducing NFAs by invariant equivalences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

A Formal Study Of Practical Regular Expressions.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2003

Follow automata.

[BibT_eX]

[DOI]

Inf. Comput., 2003

Fast Algorithms for Extended Regular Expression Matching and Searching.

[BibT_eX]

[DOI]

Baozhen Shan

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

Introduction to Process Traces.

[BibT_eX]

Qing Zhao

Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

2002

Decidability of EDT0L structural equivalence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Additive Distances and Quasi-Distances Between Words.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

Advances and Trends in Automata and Formal Languages A Collection of Papers in Honour of the 60th Birthday of Helmut Jürgensen - J.UCS Special Issue.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2002

Tight Lower Bound for the State Complexity of Shuffle of Regular Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

Implementation and Application of Automata - Editor's Foreword.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2002

An Efficient Algorithm for Constructing Minimal Cover Automata for Finite Languages.

[BibT_eX]

[DOI]

Andrei Paun

Int. J. Found. Comput. Sci., 2002

State Complexity of Finite and Infinite Regular Languages.

[BibT_eX]

Bull. EATCS, 2002

On the robustness of primitive words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Factorizations of Languages and Commutativity Conditions.

[BibT_eX]

[DOI]

Acta Cybern., 2002

Regex and Extended Regex.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2002

Algorithms for Computing Small NFAs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

Constructing NFA s by Optimal Use of Positions in Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

Repetition Complexity of Words.

[BibT_eX]

[DOI]

Kaizhong Zhang

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

Minimal cover-automata for finite languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Class-is-type is inadequate for object reuse.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 2001

State Complexity of Regular Languages.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2001

On the State Complexity of k-Entry Deterministic Finite Automata.

[BibT_eX]

[DOI]

Markus Holzer

J. Autom. Lang. Comb., 2001

A sharpening of the Parikh mapping.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2001

Tree-systems of morphisms.

[BibT_eX]

[DOI]

Acta Informatica, 2001

Minimal Covers of Formal Languages.

[BibT_eX]

[DOI]

Michael Domaratzki

Jeffrey O. Shallit

Proceedings of the Developments in Language Theory, 5th International Conference, 2001

The time dimension of computation models.

[BibT_eX]

Proceedings of the Where Mathematics, 2001

2000

Alternating finite automata and star-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2000

Efficient Implementation of Regular Languages Using Reversed Alternating Finite Automata.

[BibT_eX]

[DOI]

Xiuming Wu

Theor. Comput. Sci., 2000

Using DNA to solve the Bounded Post Correspondence Problem.

[BibT_eX]

[DOI]

Lila Kari

Greg Gloor

Theor. Comput. Sci., 2000

On Fairness of Many-Dimensional Trajectories.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2000

An O(n<sup>2</sup>) Algorithm for Constructing Minimal Cover Automata for Finite Languages.

[BibT_eX]

[DOI]

Andrei Paun

Proceedings of the Implementation and Application of Automata, 2000

State Complexity of Regular Languages: Finite versus Infinite.

[BibT_eX]

[DOI]

Proceedings of the Finite Versus Infinite, 2000

1999

Synchronization Expressions and Languages.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1999

Towards a DNA Solution to the Shortest Common Superstring Problem.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 1999

On Synchronization in P Systems.

[BibT_eX]

[DOI]

Gheorghe Paun

Fundam. Informaticae, 1999

Generalized Fairness and Context-Free Languages.

[BibT_eX]

[DOI]

Acta Cybern., 1999

State Complexity of Basic Operations on Finite Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata Implementation, 1999

Metric Lexical Analysis.

[BibT_eX]

[DOI]

Proceedings of the Automata Implementation, 1999

On the decomposition of finite languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 1999

Synchronization Expressions: Characterization Results and Implementation.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

Synchronization Expressions with Extended Join Operation.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1998

DNA Computing, Sticker Systems, and Universality.

[BibT_eX]

[DOI]

Acta Informatica, 1998

Implementing Reversed Alternating Finite Automaton (r-AFA) Operations.

[BibT_eX]

[DOI]

Proceedings of the Automata Implementation, 1998

Practical Rules for Reduction on the Number of States of a State Diagram.

[BibT_eX]

[DOI]

Jin Ma

Proceedings of the TOOLS 1998: 26th International Conference on Technology of Object-Oriented Languages and Systems, 1998

1997

Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Handbook of Formal Languages, Volume 1: Word, Language, Grammar., 1997

NFA to DFA Transformation for Finite Languages over Arbitrary Alphabets.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1997

Language-theoretic Complexity of Disjunctive Sequences.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Efficient Implementation of Regular Languages Using R-AFA.

[BibT_eX]

[DOI]

Xiuming Wu

Proceedings of the Automata Implementation, 1997

Decidability of fairness for context-free languages.

[BibT_eX]

Proceedings of the 3rd International Conference Developments in Language Theory, 1997

At the crossroads of DNA computing and formal languages: Characterizing recursively enumerable languages using insertion-deletion systems.

[BibT_eX]

[DOI]

Proceedings of the DNA Based Computers, 1997

Rewriting Rules for Synchronization Languages.

[BibT_eX]

[DOI]

Proceedings of the Structures in Logic and Computer Science, 1997

1996

Structural Equivalence and ET0L Grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1996

On Synchronization Languages.

[BibT_eX]

[DOI]

Lifu Guo

Fundam. Informaticae, 1996

NFA to DFA Transformation for Finite Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata Implementation, 1996

EDTOL Structural Equivalence is Decidable.

[BibT_eX]

Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995

P, NP and the Post Correspondence Problem

[BibT_eX]

[DOI]

Inf. Comput., September, 1995

Lexical Analysis with a Simple Finite-Fuzzy-Automaton Model.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 1995

Decision Problems for Patterns.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Complexity of E0L Structural Equivalence.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1995

Nondeterminism Degrees for Context-Free Languages.

[BibT_eX]

Proceedings of the Developments in Language Theory II, 1995

1994

The State Complexities of Some Basic Operations on Regular Languages.

[BibT_eX]

[DOI]

Qingyu Zhuang

Theor. Comput. Sci., 1994

Transducers and the Decidability of Independence in Free Monoids.

[BibT_eX]

[DOI]

Helmut Jürgensen

Theor. Comput. Sci., 1994

Measures of Nondeterminism for Pushdown Automata.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1994

Pumping and Pushdown Machines.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 1994

on Sparse Languages L such that LL = Sigma.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

Synchronization expressions and languages.

[BibT_eX]

[DOI]

Lifu Guo

Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, 1994

Rediscovering Pushdown Machines.

[BibT_eX]

[DOI]

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993

Decidability of the Intercode Property.

[BibT_eX]

Helmut Jürgensen

J. Inf. Process. Cybern., 1993

Morphisms and rational tranducers.

[BibT_eX]

Bull. EATCS, 1993

Inclusion is Undecidable for Pattern Languages.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

Structural Equivalences and ET0L Grammars (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992

Attempting guards in parallel: A data flow approach to execute generalized guarded commands.

[BibT_eX]

[DOI]

R. Govindarajan

V. S. Lakshmanan

Int. J. Parallel Program., 1992

Iterative tree automata, alternating Turing machines, and uniform Boolean circuits: relationships and characterization.

[BibT_eX]

[DOI]

Abdelaziz Fellah

Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990's, 1992

Characterizing Regular Languages with Polynomial Densities.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Obtaining Tight Upper Bounds for the State Complexities of DFA Operations.

[BibT_eX]

Qingyu Zhuang

Proceedings of the Computing and Information, 1992

1991

Decidability of Structural Equivalence of E0L Grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

On the state complexity of intersection of regular languages.

[BibT_eX]

[DOI]

Qingyu Zhuang

SIGACT News, 1991

Primary Types of Instances of the Post Correspondence Problem.

[BibT_eX]

Bull. EATCS, 1991

Cellular automata, omegaomega-regular sets, and sofic systems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1991

Data Flow Implementation of Generalized Guarded Commands.

[BibT_eX]

[DOI]

R. Govindarajan

Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Degrees of Nondeterminism for Pushdown Automata.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

ParC project: practical constructs for parallel programming languages.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual International Computer Software and Applications Conference, 1991

1990

The Immortality Problem for LAG Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1990

Constructions for alternating finite automata.

[BibT_eX]

[DOI]

Abdelaziz Fellah

Helmut Jürgensen

Int. J. Comput. Math., 1990

1989

On the Limit Sets of Cellular Automata.

[BibT_eX]

[DOI]

Jan K. Pachl

SIAM J. Comput., 1989

1988

Can the catenation of two weakly sparse languages be dense?

[BibT_eX]

[DOI]

Discret. Appl. Math., 1988

Undecidability of CA Classification Schemes.

[BibT_eX]

[DOI]

Complex Syst., 1988

1986

Real-Time, Pseudo Real-Time, and Linear-Time ITA.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1986

On the equivalence of grammars inferred from derivation.

[BibT_eX]

Efim B. Kinber

Bull. EATCS, 1986

A property of real-time trellis automata.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1986

1985

Translation of Systolic Algorithms between Systems of Different Topology.

[BibT_eX]

Proceedings of the International Conference on Parallel Processing, 1985

1984

Iterative Tree Automata.

[BibT_eX]

[DOI]