scientific article; zbMATH DE number 3254905
From MaRDI portal
Publication:5541339
Cited in
(only showing first 100 items - show all)- Equivalence of regular expressions over a partially commutative alphabet
- On input-revolving deterministic and nondeterministic finite automata
- The inclusion problem for some classes of deterministic multitape automata
- Equivalence of infinite behavior of finite automata
- A note on Parikh maps, abstract languages, and decision problems
- Another generalization of Higman's well quasi order result on ^*
- Notes on finitely generated semigroups and pumping conditions for regular languages
- The complementation problem for Büchi automata with applications to temporal logic
- Finite automata and unary languages
- On a subclass of \(\infty\)-regular languages
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
- Concatenation of inputs in a two-way automaton
- A note on the reduction of two-way automata to one-way automata
- Complementing deterministic Büchi automata in polynomial time
- Simple counter machines and number-theoretic problems
- A hierarchy of deterministic languages
- Vector addition systems and regular languages
- On inclusion problem for deterministic multitape automata
- A note on decision problems for three-way two-dimensional finite automata
- Quasiidentities in a free semigroup
- Projections of languages recognizable by probabilistic and alternating finite multitape automata
- Automatic groups and amalgams
- Minimisation of acyclic deterministic automata in linear time
- Finite automata on directed graphs
- Multiplicities: A deterministic view of nondeterminism
- Infinite trees and automaton-definable relations over -words
- Theories of automata on \(\omega\)-tapes: a simplified approach
- Fuzzy neural networks
- Some free submonoids of the free monoid of prefix codes
- Realizations of fuzzy languages by probabilistic, max-product, and maximin automata
- Adjoint machines, state-behavior machines, and duality
- Sequentielle Analyse kontextfreier Sprachen
- Fuzzy automata and languages
- A characterization of automata and a direct product decomposition
- On the structure of Abelian automata
- Finite automata with multiplication
- The inclusion problem for simple languages
- ``V-tape, a virtual memory oriented data type, and its resource requirements
- Regular subsets in semi-direct products of monoids
- One way finite visit automata
- Inference for regular bilanguages
- Finite automata, definable sets, and regular expressions over \(\omega^n\)- tapes
- On two-way sequential transductions of full semi-AFL's
- Sequential fuzzy system identification
- Some decision problems concerning sequential transducers and checking automata
- The word problem for groups with regular relations. Improvement of the Knuth-Bendix algorithm
- Progress measures, immediate determinacy, and a subset construction for tree automata
- Finite-memory automata
- Complexity results for two-way and multi-pebble automata and their logics
- Some decisional problems on rational relations
- From regular expressions to DFA's using compressed NFA's
- The equivalence of stack-counter acceptors and quasi-realtime stack- counter acceptors
- Program schemes, recursion schemes, and formal languages
- Controlled pushdown automata
- A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
- From bidirectionality to alternation.
- An algebraic characterization of deterministic regular languages over infinite alphabets.
- Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
- Modelization of deterministic rational relations
- Distances between languages and reflexivity of relations
- Finite automata capturing winning sequences for all possible variants of the \(PQ\) penny flip game
- Regular language representations in the constructive type theory of Coq
- Descriptional complexity of limited automata
- Reachability analysis of reversal-bounded automata on series-parallel graphs
- Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
- Angelic processes for CSP via the UTP
- On the descriptional complexity of finite automata with modified acceptance conditions
- State complexity of some operations on binary regular languages
- Complementing unary nondeterministic automata
- Reflections on the phenomenon of Aleksej Andreevich Lyapunov
- On the transformation semigroups of finite automata
- Polynomial complete problems in automata theory
- Ambiguity and decision problems for local adjunct languages
- Halbgruppen und Automaten
- Automata, Boolean matrices, and ultimate periodicity.
- Alternation and bounded concurrency are reverse equivalent.
- Communication complexity method for measuring nondeterminism in finite automata
- Testing conformance of a deterministic implementation against a non-deterministic stream X-machine
- Two techniques in the area of the star problem in trace monoids
- Fuzzy grammar theory based on lattices
- An n n algorithm for hyper-minimizing a (minimized) deterministic automaton
- On the representation of finite deterministic 2-tape automata
- Effectful applicative similarity for call-by-name lambda calculi
- New size hierarchies for two way automata
- Oblivious DFA evaluation on joint input and its applications
- Automata and rational expressions
- Finite transducers and rational transductions
- Descriptional complexity of regular languages
- Černý's conjecture and the road colouring problem
- Time-aware uniformization of winning strategies
- Determinization of fuzzy automata by factorizations of fuzzy states and right invariant fuzzy quasi-orders
- Modeling of RNA secondary structures using two-way quantum finite automata
- Reversibility of computations in graph-walking automata
- Epistemic GDL: a logic for representing and reasoning about imperfect information games
- Removing nondeterminism in constant height pushdown automata
- Oblivious two-way finite automata: decidability and complexity
- The ``equal last letter predicate for words on infinite alphabets and classes of multitape automata
- On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's
- Determination of finite automata accepting subregular languages
- Natural strategic ability
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)