The following pages link to (Q3859267):
Displayed 50 items.
- Using finite transducers for describing and synthesising structural time-series constraints (Q265697) (← links)
- Recognizable subsets of the two letter plactic monoid (Q287233) (← links)
- Decision problems for word-hyperbolic semigroups (Q306545) (← links)
- On regular realizability problems for context-free languages (Q327306) (← links)
- On the computation of quotients and factors of regular languages (Q351995) (← links)
- Kadanoff sand pile model. Avalanche structure and wave shape (Q393152) (← links)
- Translating regular expression matching into transducers (Q420836) (← links)
- Probabilistic grammars and languages (Q438593) (← links)
- On CD-systems of stateless deterministic R-automata with window size one (Q439938) (← links)
- A standard correspondence on epicentral words (Q444409) (← links)
- Closures of regular languages for profinite topologies. (Q467504) (← links)
- Fixed points of endomorphisms of trace monoids. (Q467531) (← links)
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. (Q479731) (← links)
- Finiteness results for subgroups of finite extensions. (Q479771) (← links)
- Restarting transducers, regular languages, and rational relations (Q493655) (← links)
- Language-theoretic problems in certain matrix monoids (Q496056) (← links)
- Equational tree transformations (Q551198) (← links)
- Adding symbolic information to picture models: definitions and properties (Q557811) (← links)
- On the complexity of some extended word problems defined by cancellation rules (Q578921) (← links)
- Expansions, free inverse semigroups, and Schützenberger product (Q579420) (← links)
- La reconnaissance des facteurs d'un mot dans un texte (Q580994) (← links)
- HDTOL matching of computations of multitape automata (Q582131) (← links)
- Iterative and recursive matrix theories (Q595766) (← links)
- Families of languages defined by ciliate bio-operations (Q596126) (← links)
- Sur les générateurs algébriques et linéaires (Q599515) (← links)
- Fixed points of endomorphisms over special confluent rewriting systems. (Q604812) (← links)
- A characterization of (regular) circular languages generated by monotone complete splicing systems (Q606981) (← links)
- Subsequential transducers: a coalgebraic perspective (Q618167) (← links)
- Tilings and submonoids of metabelian groups. (Q633769) (← links)
- Unique decipherability in the monoid of languages: an application of rational relations (Q639857) (← links)
- A note on the commutative closure of star-free languages (Q672729) (← links)
- Representations and complete semiring morphisms (Q672829) (← links)
- Varieties and rational functions (Q673101) (← links)
- \(\mathbb{N}\)-rationality of zeta functions (Q679031) (← links)
- Equations over finite sets of words and equivalence problems in automata theory (Q685449) (← links)
- Synchronized rational relations of finite and infinite words (Q685453) (← links)
- An optimal pre-determinization algorithm for weighted transducers (Q703490) (← links)
- Well quasi-orders and context-free grammars (Q703570) (← links)
- Deleting string rewriting systems preserve regularity (Q703575) (← links)
- Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton (Q703577) (← links)
- Height reducing problem on algebraic integers (Q714398) (← links)
- On suffix extensions in suffix trees (Q714837) (← links)
- Expressive power of \(\text{LL}(k)\) Boolean grammars (Q719251) (← links)
- Finite state complexity (Q719308) (← links)
- On the complexity of computing the profinite closure of a rational language (Q719326) (← links)
- Inverse subsemigroups of finite index in finitely generated inverse semigroups (Q722557) (← links)
- Nivat's processing systems: decision problems related to protection and synchronization (Q761796) (← links)
- Systems of equations over a free monoid and Ehrenfeucht's conjecture (Q786545) (← links)
- An algebraic characterization of some principal regulated rational cones (Q786546) (← links)
- It is decidable whether a regular language is pure context-free (Q787679) (← links)