The following pages link to (Q4385529):
Displaying 12 items.
- On the regular structure of prefix rewriting (Q685354) (← links)
- Parallelism and synchronization in two-level metacontrolled substitution grammars (Q1144382) (← links)
- On ambiguity in EOL systems (Q1148689) (← links)
- On the emptiness of the intersection of two DOS languages problem (Q1155962) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Computing with graph rewriting systems with priorities (Q1261464) (← links)
- Root-restricted Kleenean rotations (Q1944034) (← links)
- Nonassociativity à la Kleene (Q3522872) (← links)
- An analysis of Lambek's production machines (Q4385678) (← links)
- Formulae and Asymptotics for Coefficients of Algebraic Functions (Q5364226) (← links)
- Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series (Q5958624) (← links)
- Undecidability of the universal support problem for weighted automata over zero-sum-free commutative semirings (Q6548961) (← links)
