On the complexity of the string generation problem
-
A. S. Okhotin
We consider the problem of generating strings that belong to certain languages and satisfy some additional restrictions. Languages are defined by formal grammars and automata. The following formulation of this problem as a decision one is proposed: for a language represented by a formal grammar or an automaton and a pair of strings, determine whether there exists a string in this language that lies lexicographically between these strings. It is proved that this problem is NLOGSPACE-complete for deterministic and nondeterministic finite automata and for linear context-free grammars; P-complete for context-free grammars of the general form; NP-complete for alternating finite automata, for conjunctive grammars and for linear conjunctive grammars; PSPACE-complete for context-sensitive grammars and linear bounded automata.
Copyright 2003, Walter de Gruyter
Articles in the same Issue
- Collectives of automata in labyrinths
- On the complexity of the string generation problem
- On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
- On special properties of a composition of automata
- Limit distributions of the number of cycles of given length in a random permutation with given number of cycles
- Emergence of a giant component in a random permutation with given number of cycles
Articles in the same Issue
- Collectives of automata in labyrinths
- On the complexity of the string generation problem
- On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis {x → y, }
- On special properties of a composition of automata
- Limit distributions of the number of cycles of given length in a random permutation with given number of cycles
- Emergence of a giant component in a random permutation with given number of cycles
