The following pages link to (Q4385527):
Displaying 50 items.
- The full quotient and its closure property for regular languages (Q293180) (← links)
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- Monadic partition logics and finite automata (Q671644) (← links)
- Rewriting extended regular expressions (Q673635) (← links)
- On Simon's string searching algorithm (Q685473) (← links)
- Acyclic networks maximizing the printing complexity (Q703493) (← links)
- Syntactic complexity of regular ideals (Q722210) (← links)
- Weighted automata and multi-valued logics over arbitrary bounded lattices (Q764336) (← links)
- Constants and label-equivalence: a decision procedure for reflexive regular splicing languages (Q847663) (← links)
- Automata on linear orderings (Q859978) (← links)
- Kernel methods for learning languages (Q950199) (← links)
- The theory of \(\langle \mathbb{N} , +, V_ k, V_ l\rangle\) is undecidable (Q1202930) (← links)
- Deciding whether a finite set of words has rank at most two (Q1210296) (← links)
- On number systems with finite degree of ambiguity (Q1271465) (← links)
- On a question of A. Salomaa The equational theory of regular expressions over a singleton alphabet is not finitely based (Q1274921) (← links)
- A construction on finite automata that has remained hidden (Q1275469) (← links)
- Deterministic generalized automata (Q1285583) (← links)
- Temporal connectives versus explicit timestamps to query temporal databases (Q1305921) (← links)
- An equational axiomatization for multi-exit iteration (Q1369097) (← links)
- Bertrand numeration systems and recognizability (Q1391295) (← links)
- On the factors of automatic words (Q1392016) (← links)
- Optimal insertion in deterministic DAWGs (Q1399983) (← links)
- On images of D0L and DT0L power series. (Q1401199) (← links)
- Families of locally testable languages (Q1575558) (← links)
- Alternating finite automata and star-free languages (Q1575674) (← links)
- Minimization algorithms for sequential transducers (Q1575676) (← links)
- Wreath product and infinite words (Q1587974) (← links)
- A unified language processing methodology (Q1603702) (← links)
- Logic over words on denumerable ordinals (Q1604197) (← links)
- Strongly connected synchronizing automata and the language of minimal reset words (Q1637601) (← links)
- It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base (Q1773328) (← links)
- The structure of reflexive regular splicing languages via Schützenberger constants (Q1779297) (← links)
- A probabilistic approach to navigation in Hypertext (Q1818980) (← links)
- Monadic simultaneous rigid \(E\)-unification (Q1960540) (← links)
- On the representation of finite deterministic 2-tape automata (Q1960654) (← links)
- A bound for the length of the shortest reset words for semisimple synchronizing automata via the packing number (Q2011387) (← links)
- Finite language forbidding-enforcing systems (Q2011661) (← links)
- Computable fixpoints in well-structured symbolic model checking (Q2248074) (← links)
- On the expressive power of temporal logic (Q2366686) (← links)
- Matrix Code (Q2441509) (← links)
- Regular splicing languages and subclasses (Q2484444) (← links)
- Parsing with a finite dictionary (Q2484450) (← links)
- Linear splicing and syntactic monoid (Q2489941) (← links)
- On the power of circular splicing (Q2565850) (← links)
- Clausal Tableaux for Hybrid PDL (Q2825411) (← links)
- Theme and Variations on the Concatenation Product (Q3014930) (← links)
- Representation of (Left) Ideal Regular Languages by Synchronizing Automata (Q3194726) (← links)
- On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases (Q3519495) (← links)
- Matching Trace Patterns with Regular Policies (Q3618572) (← links)
- A Kleene Theorem for Forest Languages (Q3618626) (← links)
