The following pages link to (Q4991691):
Displayed 23 items.
- Finite automata and unary languages (Q1099644) (← links)
- Program schemata as automata. I (Q1214748) (← links)
- Decomposition theorems for finite sequential machines (Q1220460) (← links)
- Noiselike transforms of \(\omega\)-events (Q1227706) (← links)
- Complete system of equivalent transformations for two-tape automata with disjoint loops (Q1592077) (← links)
- Classes of discrete optimization problems and their decision problems (Q2265336) (← links)
- New operations and regular expressions for two-dimensional languages over one-letter alphabet (Q2484449) (← links)
- Bracketed context-free languages (Q2525996) (← links)
- Probabilistic tree automata and context free languages (Q2542994) (← links)
- Multitape finite automata with rewind instructions (Q2555470) (← links)
- More Concise Representation of Regular Languages by Automata and Regular Expressions (Q3533024) (← links)
- On the State Complexity of Operations on Two-Way Finite Automata (Q3533031) (← links)
- Deterministic Input-Reversal and Input-Revolving Finite Automata (Q3540102) (← links)
- Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity (Q3602795) (← links)
- An Automata Theoretic Approach to Rational Tree Relations (Q5448669) (← links)
- Church’s Problem and a Tour through Automata Theory (Q5452202) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- Automata-Theoretic Model Checking Revisited (Q5452603) (← links)
- Lattice Automata (Q5452607) (← links)
- On the Class of Predicates Decidable by Two-Way Multitape Finite Automata (Q5514601) (← links)
- Zur Theorie abstrakter stochastischer Automaten (Q5549818) (← links)
- Unrecognizable Sets of Numbers (Q5552168) (← links)
- A Theory of Computer Instructions (Q5568400) (← links)