Parsing Boolean grammars over a one-letter alphabet using online convolution

Okhotin, Alexander; Reitwieβner, Christian

doi:10.1016/j.tcs.2012.06.032

Cited by 6 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A similar hierarchy can be established for a one-symbol alphabet. In this case, D is exactly the class of regular unary languages, N contains all regular languages, and both M and N, as special cases of Boolean grammars, can be recognized in time n • log 3 n • 2 O(log * n) [39]. The class P still contains all recursive unary languages.…”

Section: Discussionmentioning

confidence: 99%

On language equations with concatenation and various sets of Boolean operations

Okhotin

2015

RAIRO-Theor. Inf. Appl.

View full text Add to dashboard Cite

Systems of equations of the form Xi = ϕi(X1, . . . , Xn), for 1 i n, in which the unknowns Xi are formal languages, and the right-hand sides ϕi may contain concatenation and union, are known for representing context-free grammars. If, instead of union only, another set of Boolean operations is used, the expressive power of such equations may change: for example, using both union and intersection leads to conjunctive grammars [A. Okhotin, J. Automata, Languages and Combinatorics 6 (2001) 519-535], whereas using all Boolean operations allows all recursive sets to be expressed by unique solutions [A. Okhotin, Decision problems for language equations with Boolean operations, Automata, Languages and Programming, ICALP 2003, Eindhoven, The Netherlands, 239-251]. This paper investigates the expressive power of such equations with any possible set of Boolean operations. It is determined that different sets of Boolean operations give rise to exactly seven families of formal languages: the recursive languages, the conjunctive languages, the context-free languages, a certain family incomparable with the context-free languages, as well as three subregular families.

show abstract

Section: Discussionmentioning

confidence: 99%