The following pages link to Marie-Pierre Béal (Q385505):
Displaying 50 items.
- Sofic tree-shifts (Q385506) (← links)
- An algorithmic view of gene teams (Q596107) (← links)
- Embeddings of local automata (Q716395) (← links)
- Shifts of \(k\)-nested sequences (Q728261) (← links)
- Completing codes in a sofic shift (Q732037) (← links)
- Sofic-Dyck shifts (Q897881) (← links)
- Unambiguous automata (Q942992) (← links)
- (Q1106179) (redirect page) (← links)
- Codes circulaires, automates locaux et entropie (Q1106180) (← links)
- On the bound of the synchronization delay of a local automaton (Q1275089) (← links)
- (Q1585505) (redirect page) (← links)
- Forbidden words in symbolic dynamics (Q1585506) (← links)
- Tree-shifts of finite type (Q1758160) (← links)
- Determinization of transducers over finite and infinite words. (Q1853526) (← links)
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality. (Q1853731) (← links)
- A weak equivalence between shifts of finite type (Q1865259) (← links)
- Determinization of transducers over infinite words: The general case (Q1882533) (← links)
- Enumerative sequences of leaves and nodes in rational trees (Q1960518) (← links)
- Symbolic dynamics (Q2244822) (← links)
- Generalized Dyck shifts (Q2399368) (← links)
- A quadratic algorithm for road coloring (Q2449052) (← links)
- Codes and sofic constraints (Q2484447) (← links)
- Codes, unambiguous automata and sofic systems. (Q2490804) (← links)
- A hierarchy of shift equivalent sofic shifts (Q2575742) (← links)
- Checking whether a word is Hamming-isometric in linear time (Q2676462) (← links)
- (Q2708950) (← links)
- Computing the prefix of an automaton (Q2729627) (← links)
- (Q2754176) (← links)
- (Q2776539) (← links)
- Sofic-Dyck Shifts (Q2922003) (← links)
- Tree algebra of sofic tree languages (Q2934277) (← links)
- (Q3062121) (← links)
- A QUADRATIC UPPER BOUND ON THE SIZE OF A SYNCHRONIZING WORD IN ONE-CLUSTER AUTOMATA (Q3086238) (← links)
- Decidability of Geometricity of Regular Languages (Q3167484) (← links)
- CODING PARTITIONS OF REGULAR SETS (Q3406720) (← links)
- Conjugacy and Equivalence of Weighted Automata and Functional Transducers (Q3434682) (← links)
- Deciding Proper Conjugacy of Classes of One-Sided Finite-Type-Dyck Shifts (Q3451099) (← links)
- On the generating sequences of regular languages on <i>k</i> symbols (Q3452513) (← links)
- The method of poles: a coding method for constrained channels (Q3487274) (← links)
- Presentations of Constrained Systems With Unconstrained Positions (Q3546549) (← links)
- Sofic and Almost of Finite Type Tree-Shifts (Q3569727) (← links)
- A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata (Q3637215) (← links)
- Decidability of Conjugacy of Tree-Shifts of Finite Type (Q3638030) (← links)
- (Q3742743) (← links)
- (Q3838997) (← links)
- A note on the method of poles for code construction (Q4308790) (← links)
- (Q4432976) (← links)
- A Finite State Version of the Kraft--McMillan Theorem (Q4507391) (← links)
- (Q4508395) (← links)
- Asynchronous sliding block maps (Q4508637) (← links)
