Efficient automaton-based recognition for linear conjunctive languages

Authors:
Alexander Okhotin
Affiliations:
Department of Computing and Information Science, Queen's University, Kingston, Ontario, Canada
Venue:
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Year:
2002

Citing 3
Cited 1

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Conjunctive grammars

Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
On the closure properties of linear conjunctive languages

Theoretical Computer Science

State complexity of linear conjunctive languages

Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies practical algorithms for dealing with a particular family of cellular automata, which has recently been proved computationally equivalent to linear conjunctive grammars. The relation between these grammars and these automata resembles that between regular expressions and finite automata: while the former are better suited for human use, the latter are considerably easier to implement. In this paper, an algorithm for converting an arbitrary linear conjunctive grammar to an equivalent automaton is proposed, and different techniques of reducing the size of existing automata are studied.