Homomorphisms and inverse homomorphisms on graph-walking automata
- 17 September 2023
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 979, 114197
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education and Science of the Russian Federation (075-15-2022-287)
This publication has 20 references indexed in Scilit:
- State complexity of operations on two-way finite automata over a unary alphabetTheoretical Computer Science, 2012
- Tree-Walking Automata Do Not Recognize All Regular LanguagesSIAM Journal on Computing, 2008
- Complementing two-way finite automataInformation and Computation, 2007
- Complementing deterministic tree-walking automataInformation Processing Letters, 2006
- Tree-walking automata cannot be determinizedTheoretical Computer Science, 2006
- Graph exploration by a finite automatonTheoretical Computer Science, 2005
- Converting two-way nondeterministic unary automata into simpler automataTheoretical Computer Science, 2003
- A homomorphic characterization of regular languagesDiscrete Applied Mathematics, 1982
- Automata and LabyrinthsMathematische Nachrichten, 1978
- Bottom-up and top-down tree transformations— a comparisonTheory of Computing Systems, 1975