scientific article; zbMATH DE number 3254905
From MaRDI portal
Publication:5541339
Cited in
(only showing first 100 items - show all)- Complexity results for multi-pebble automata and their logics
- State complexity of star of union and square of union on \textit{k} regular languages
- Abstract families of relations
- A characterization of automata and a direct product decomposition
- Language Recognition Power and Succinctness of Affine Automata
- State complexity of union and intersection of star on \(k\) regular languages
- Sequential fuzzy system identification
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs
- Reversibility of computations in graph-walking automata
- Reversal of binary regular languages
- State-complexity of finite-state devices, state compressibility and incompressibility
- Übertragung automatentheoretischer Sätze auf Chomsky-Sprachen
- Zur Theorie der nichtdeterministischen und unvollständigen Automaten
- Translation from classical two-way automata to pebble two-way automata
- Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
- Rewriting of regular expressions and regular path queries
- ``V-tape, a virtual memory oriented data type, and its resource requirements
- Regular subsets in semi-direct products of monoids
- Inference for regular bilanguages
- On Repetition Languages
- Loops in automata and HDTOL relations
- The Complexity of Languages Resulting from the Concatenation Operation
- Algorithms and topology of Cayley graphs for groups.
- A note on the emptiness problem for alternating finite-memory automata
- The operation on formal power series
- On Stateless Deterministic Restarting Automata
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- The conjugacy problem for Higman’s group
- Sufficient conditions of equivalence of three-tape automata
- Bounded Regular Sets
- The zig-zag power series: A two-way version of the \({}^*\) operator.
- Some decisional problems on rational relations
- Time-aware uniformization of winning strategies
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Modeling of RNA secondary structures using two-way quantum finite automata
- Automata theory and model checking
- Effectful applicative similarity for call-by-name lambda calculi
- Real-time computations with restricted nondeterminism
- On two-way sequential transductions of full semi-AFL's
- Stone duality and the recognisable languages over an algebra
- Decision Problems of Finite Automata Design and Related Arithmetics
- scientific article; zbMATH DE number 23963 (Why is no real title available?)
- Infinite trees and automaton-definable relations over -words
- From bidirectionality to alternation.
- The state complexity of \(L^{2}\) and \(L^k\)
- Automatic construction of test sets: theoretical approach
- General framework
- Partial derivatives of regular expressions and finite automaton constructions
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
- Some decision problems concerning sequential transducers and checking automata
- The developments of the concept of machine computability from 1936 to the 1960s
- Spiking Neural P Systems with Thresholds
- Factorization forests for infinite words and applications to countable scattered linear orderings
- The problem of equivalent transformations for homogeneous multitape automata
- On the transformation semigroups of finite automata
- From regular expressions to DFA's using compressed NFA's
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- A note on the reduction of two-way automata to one-way automata
- Size complexity of rotating and sweeping automata
- Regular languages with variables on graphs
- Alternating states for dual nondeterminism in imperative programming
- A note on autodense related languages
- Canonical systems which produce periodic sets
- The finite automata approaches in stringology
- The inclusion problem for simple languages
- Two-way representations and weighted automata
- New size hierarchies for two way automata
- Converting Self-verifying Automata into Deterministic Automata
- A note on undecidable properties of formal languages
- On ywo-way, two-tape automata
- On the equivalence of recursive and nonrecursive Datalog programs
- On approximate enhanced covers under Hamming distance
- Nondeterministic fuzzy automata
- State complexity of union and intersection of square and reversal on \(k\) regular languages
- Prefix-primitive annihilators of languages under some operations
- Rational relations having a rational trace on each finite intersection of rational relations
- Automata theory and control theory - a rapprochement
- System identification via state characterization
- scientific article; zbMATH DE number 3305096 (Why is no real title available?)
- Two techniques in the area of the star problem in trace monoids
- Another generalization of Higman's well quasi order result on ^*
- Improved algorithms for computing the greatest right and left invariant Boolean matrices and their application
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Adjoint machines, state-behavior machines, and duality
- Factor theory and the unity of opposites
- Finite automata theory with membership values in lattices
- Hybrid one-dimensional reversible cellular automata are regular
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- On multi-head automata with restricted nondeterminism
- The complexity of asynchronous model based testing
- State complexity of some operations on binary regular languages
- On the capabilities of systolic systems
- On size reduction techniques for multitape automata
- Some Remarks on Abstract Machines
- HDTOL matching of computations of multitape automata
- Solvable classes of discrete dynamic programming
- Proof-directed program transformation: a functional account of efficient regular expression matching
- Affine computation and affine automaton
- Projections of languages recognizable by probabilistic and alternating finite multitape 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 Q5541339)