Star-free picture expressions are strictly weaker than first-order logic
From MaRDI portal
Publication:4571966
DOI10.1007/3-540-63165-8_191zbMath1401.03068MaRDI QIDQ4571966
Publication date: 4 July 2018
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-63165-8_191
68R15: Combinatorics on words
68Q45: Formal languages and automata
03D05: Automata and formal grammars in connection with logical questions
Related Items
Dot-depth, monadic quantifier alternation, and first-order closure over grids and pictures, Characterizations of recognizable picture series, Weighted picture automata and weighted logics, New operations and regular expressions for two-dimensional languages over one-letter alphabet, Picture codes