scientific article; zbMATH DE number 7378379
From MaRDI portal
DOI10.4230/LIPIcs.MFCS.2018.62MaRDI QIDQ5005165
Lukas Fleischer, Manfred Kufleitner
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1804.10459
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Scattered Factor-Universality of Words, On the Simon's congruence neighborhood of languages, Absent Subsequences in Words, Ranking and Unranking k-Subsequence Universal Words, Longest Common Subsequence with Gap Constraints, On Arch Factorization and Subword Universality for Words and Compressed Words, Subsequences in bounded ranges: matching and analysis problems, Existential Definability over the Subword Ordering, Simon's congruence pattern matching, Absent subsequences in words, Unnamed Item, Nearly \(k\)-universal words -- investigating a part of Simon's congruence, On Simon's congruence closure of a string, Unnamed Item, Nearly \(k\)-universal words -- investigating a part of Simon's congruence, On Simon's congruence closure of a string
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the word problem for syntactic monoids of piecewise testable languages.
- Normal forms under Simon's congruence
- Finite-automaton aperiodicity is PSPACE-complete
- Kernel methods for learning languages
- Characterizations of some classes of regular events
- Classifying regular events in symbolic logic
- On the height of towers of subsequences and prefixes
- On the index of Simon's congruence for piecewise testability
- An Algebraic Characterization of Strictly Piecewise Languages
- Structure Theorem and Strict Alternation Hierarchy for FO^2 on Words
- On the Complexity of k-Piecewise Testability and the Depth of Automata
- On Languages Piecewise Testable in the Strict Sense
- Alternative Automata Characterization of Piecewise Testable Languages
- Ordering by Divisibility in Abstract Algebras
