scientific article; zbMATH DE number 3254906

Cited in

(only showing first 100 items - show all)

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

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)