Closure under reversal of languages over infinite alphabets

DOI10.1007/978-3-319-90530-3_13zbMath1484.68087OpenAlexW2802906955MaRDI QIDQ1625153

Liat Peterfreund, Michael Kaminski, Daniel Genkin

Publication date: 28 November 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-90530-3_13

zbMATH Keywords

periodicityinfinite alphabetsclosure propertiesreversal of languagesweak pebble automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (1)

Subsequence versus substring constraints in sequence pattern languages

This page was built for publication: Closure under reversal of languages over infinite alphabets