On state complexity of finite word and tree languages

Authors:
Aniruddh Gandhi;Bakhadyr Khoussainov;Jiamou Liu
Affiliations:
Department of Computer Science, University of Auckland, New Zealand;Department of Computer Science, University of Auckland, New Zealand;School of Computing and Mathematical Sciences, Auckland University of Technology, New Zealand
Venue:
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Year:
2012

Citing 13
Cited 0

The state complexities of some basic operations on regular languages

Theoretical Computer Science
State complexity of regular languages

Journal of Automata, Languages and Combinatorics
State Complexity of Basic Operations on Finite Languages

WIA '99 Revised Papers from the 4th International Workshop on Automata Implementation
On some applications of finite-state automata theory to natural language processing

Natural Language Engineering
Intersection of Regular Languages and State Complexity

ACM SIGACT News
State complexity of some operations on binary regular languages

Theoretical Computer Science - Descriptional complexity of formal systems
On the complexity of omega -automata

SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
State complexity of basic operations on suffix-free regular languages

Theoretical Computer Science
Incremental construction of minimal acyclic finite state automata and transducers

FSMNLP '09 Proceedings of the International Workshop on Finite State Methods in Natural Language Processing
Deterministic blow-ups of minimal nondeterministic finite automata over a fixed alphabet

DLT'07 Proceedings of the 11th international conference on Developments in language theory
Descriptional and computational complexity of finite automata---A survey

Information and Computation
State complexity of kleene-star operations on trees

WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Transformations Between Different Models of Unranked Bottom-Up Tree Automata

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the state complexity of finite word and tree languages. In particular, (1) we establish the state complexity of word languages whose words have bounded length; (2) we improve the upper bound given in [6] for union and intersection of finite word languages; and (3) we present an upper bound for union and intersection of finite tree languages.