scientific article; zbMATH DE number 3254906

Cited in

(only showing first 100 items - show all)

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

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)