scientific article; zbMATH DE number 3254906

Cited in

(90)

Complexity of probabilistic versus deterministic automata
Turing machines and bimachines
Deterministic one-way simulation of two-way deterministic finite automata over small alphabets
The zig-zag power series: A two-way version of the \({}^*\) operator.
Some results concerning two-dimensional turing machines and finite automata
scientific article; zbMATH DE number 7770057 (Why is no real title available?)
More concise representation of regular languages by automata and regular expressions
From bidirectionality to alternation.
Modeling of RNA secondary structures using two-way quantum finite automata
On the complexity of regular-grammars with integer attributes
Two-Way Automata in Coq
State succinctness of two-way finite automata with quantum and classical states
Translation from classical two-way automata to pebble two-way automata
A note on the reduction of two-way automata to one-way automata
Regular language representations in the constructive type theory of Coq
A linear-time simulation of deterministic \(d\)-limited automata
More Concise Representation of Regular Languages by Automata and Regular Expressions
Automates boustrophédon et mots infinis
On the Class of Predicates Decidable by Two-Way Multitape Finite Automata
Complexity results for multi-pebble automata and their logics
scientific article; zbMATH DE number 3976380 (Why is no real title available?)
New size hierarchies for two way automata
Efficient probability amplification in two-way quantum finite automata
Positional simulation of two-way automata: Proof of a conjecture of R. Kannan and generalizations
Nondeterministic Finite Automata—Recent Results on the Descriptional and Computational Complexity
Deciding FO-definability of regular languages
Complexity of multi-head finite automata: origins and directions
Loops and overloops for tree-walking automata
An alternating hierarchy for finite automata
Two-way and one-way quantum and classical automata with advice for online minimization problems
Two-way automata and length-preserving homomorphisms
Two-way pebble transducers for partial functions and their composition
Characterization of context-free languages by erasing automata
Complexity results for two-way and multi-pebble automata and their logics
Alternating two-way AC-tree automata
The operation \(\uparrow\) on formal power series
Automates et codes zigzag
Pebble weighted automata and weighted logics
Descriptional complexity of limited automata
Two-way unary automata versus logarithmic space
Size Complexity of Two-Way Finite Automata
Computation with multiple CTCs of fixed length and width
A note on the space complexity of some decision problems for finite automata
Linear-time limited automata
Sequences of words defined by two-way transducers
scientific article; zbMATH DE number 7561597 (Why is no real title available?)
scientific article; zbMATH DE number 7584604 (Why is no real title available?)
Two-Way Non-Uniform Finite Automata
Query automata over finite trees
scientific article; zbMATH DE number 7003194 (Why is no real title available?)
Descriptional complexity of regular languages
State-complexity of finite-state devices, state compressibility and incompressibility
Complexity of promise problems on classical and quantum automata
On the state complexity of operations on two-way finite automata
Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata
Converting nondeterministic two-way automata into small deterministic linear-time machines
Concatenation of inputs in a two-way automaton
On the transformation of two-way deterministic finite automata to unambiguous finite automata
A characterization of two-way deterministic classes of languages
Unbounded-error quantum computation with small space bounds
Regular Transformations of Data Words Through Origin Information
Two-way deterministic automata with two reversals are exponentially more succinct than with one reversal
Two-way automaton computations
Finite-memory automata
Two-way automata versus logarithmic space
Removing nondeterminism in constant height pushdown automata
Attribute grammars for unranked trees as a query language for structured documents
Energy complexity of computation
The equivalence of pebbles and sensing heads for finite automata
Aperiodic string transducers
One-way resynchronizability of word transducers
Weighted two-way transducers
A more efficient notion of zigzag stability
Input- or output-unary sweeping transducers are weaker than their 2-way counterparts
On the transformation of two-way finite automata to unambiguous finite automata
From two-way to one-way finite automata -- three regular expression-based methods
Der programmierbare endliche Automat. (The programmable finite automaton)
Pebble minimization: the last theorems
The many faces of a translation
Register Transducers Are Marble Transducers
Once-Marking and Always-Marking 1-Limited Automata
Transducers of polynomial growth
Origin-equivalence of two-way word transducers is in PSPACE
Weighted two-way transducers
Performing regular operations with 1-limited automata
Two-way representations and weighted automata
On the decidability of the valuedness problem for two-way finite transducers
Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
Aperiodic string transducers
Two-way deterministic automata with jumping mode

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5541340)