scientific article; zbMATH DE number 3368555
From MaRDI portal
Publication:5641083
Cited in
(only showing first 100 items - show all)- Classifying regular languages by a split game
- Representation theorems on regular languages
- Star-free sets of integers
- Unbounded fan-in circuits and associative functions
- First-order logic and star-free sets
- Language complexity on the synchronous anonymous ring
- Semigroups and languages of dot-depth two
- Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
- Inverse monoids of dot-depth two
- Non-elementary lower bound for Propositional Duration Calculus
- On optimal factorization of free semigroups into free subsemigroups
- Observations on the complexity of regular expression problems
- Remark on the star-height-problem
- Parallel language recognition in constant time by cellular automata
- Synergy in machines
- Classifying regular events in symbolic logic
- -languages accepted by finite automata whose structures are cascade products o resets
- Logically defined subsets of \(\mathbb{N}{}^ k\)
- Regular languages in \(NC\)
- Formulas, regular languages and Boolean circuits
- On noncounting regular classes
- Star-free trace languages
- Games, equations and dot-depth two monoids
- Some results on the generalized star-height problem
- On the fixpoints of monogenic functions in free monoids
- The Burnside problem for semigroups
- Monoides syntactiques des langages algébriques
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Properties of code events and homomorphisms over regular events
- The dot-depth hierarchy of star-free languages is infinite
- Sur le produit de concatenation non ambigu
- A combinatorial property of codes having finite synchronization delay
- Characterizing the regular prefix codes and right power-bounded languages
- Splicing representations of stricly locally testable languages
- Dynamic linear time temporal logic
- On a complete set of generators for dot-depth two
- Modulo-counting quantifiers over finite trees
- On projective and separable properties
- Simple splicing systems
- Counting on CTL^*: On the expressive power of monadic path logic
- \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
- Families of locally testable languages
- Alternating finite automata and star-free languages
- Optimal estimation on the order of local testability of finite automata
- LANGAGE: A Maple package for automaton characterization of regular languages
- Star free expressions over the reals
- Right and left locally testable languages
- Logic over words on denumerable ordinals
- Separability by piecewise testable languages is \textsc{PTime}-complete
- Grammatical inference of directed acyclic graph languages with polynomial time complexity
- Operator precedence and the visibly pushdown property
- Local temporal logic is expressively complete for cograph dependence alphabets
- Expressive power of existential first-order sentences of Büchi's sequential calculus
- The structure of reflexive regular splicing languages via Schützenberger constants
- Classes of languages generated by the Kleene star of a word
- A probabilistic approach to navigation in Hypertext
- Games, equations and the dot-depth hierarchy
- Expressive completeness of duration calculus.
- Counting modulo quantifiers on finite structures
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic
- Star-free sets of words on ordinals
- Languages defined with modular counting quantifiers
- Towards a language theory for infinite N-free pomsets.
- Bilateral locally testable languages.
- Vectorial languages and linear temporal logic
- Regular sets of infinite message sequence charts
- Inclusion relations between some congruences related to the dot-depth hierarchy
- On the splicing operation
- Algorithms finding the order of local testability of deterministic finite automaton and estimations of the order
- Theory of reaction automata: a survey
- Some properties of iterated languages
- Subsequence versus substring constraints in sequence pattern languages
- A deterministic parsing algorithm for ambiguous regular expressions
- Weighted operator precedence languages
- The alphabetic complexity in homomorphic definitions of word, tree and picture languages
- Regularity conditions for iterated shuffle on commutative regular languages
- State complexity of permutation and related decision problems on alphabetical pattern constraints
- Beyond operator-precedence grammars and languages
- Operator precedence temporal logic and model checking
- Homomorphic characterization of tree languages based on comma-free encoding
- Work-sensitive dynamic complexity of formal languages
- Finite semigroup varieties of the form V*D
- Determination of finite automata accepting subregular languages
- Pro-aperiodic monoids via saturated models
- Non-erasing Chomsky-Schützenberger theorem with grammar-independent alphabet
- A sufficient condition to polynomially compute a minimum separating DFA
- Generic results for concatenation hierarchies
- Codensity, profiniteness and algebras of semiring-valued measures
- Syntactic complexity of bifix-free regular languages
- Boolean algebras of regular languages
- Omega-rational expressions with bounded synchronization delay
- Concatenation-free languages
- Regulated variants of limited context restarting automata
- On the expressive power of temporal logic
- Bounded model checking of infinite state systems
- Weighted automata and weighted logics
- Accepting splicing systems with permitting and forbidding words
- Concatenation hierarchies: new bottle, old wine
- Decidability and universality of quasiminimal subshifts
- Message exchange games in strategic contexts
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 Q5641083)
