Titlebook: Developments in Language Theory; 20th International C Sre?ko Brlek,Christophe Reutenauer Conference proceedings 2016 Springer-Verlag Berlin

GRUEL

watertight,

Degrees of Infinite Words, Polynomials and Atoms,rtance in a wide range of fields, from formal languages to pure mathematics and physics. While finite automata for recognising and transforming languages are well-understood, very little is known about the power of automata to transform infinite words..We use methods from linear algebra and analysis

Constrain

辭職

Alternating Demon Space Is Closed Under Complement and Other Simulations for Sublogarithmic Space,ed initially. Under weak constructibility assumptions, not excluding monotone functions below ., we show: .?.. This extends, to sublogarithmic space, the classical simulation of alternating space by deterministic time. .?., a simulation with simultaneous bounds on time and space. This improves the k

威脅你

LATE

On Families of Full Trios Containing Counter Machine Languages,ng and decreasing phases is specified by some fixed “pattern”. We consider families of languages defined by various pattern behaviors and show that some correspond to the smallest full trios containing restricted classes of bounded semilinear languages. For example, one such family is exactly the sm

endoscopy

Non-regular Maximal Prefix-Free Subsets of Regular Languages,ny non-regular MPFS..Next, we prove that if a regular language has any non-regular MPFS, then it also has a MPFS which is context-sensitive but not context-free, it has a MPFS which is recursive but not context-sensitive, and it has a MPFS which is not recursively enumerable..We show that no regular

MAIM

Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata,new class called bounded-balance MPDAs. These MPDAs allow for infinitely deep nesting/nesting intersection, as long as the nesting depth differences within each scope stay within the balance bound. We compare our contributions to various related MPDAs and ambiguity detection methods.

Aerophagia

佛刊

Outfix-Guided Insertion, operation and decision problems related to outfix-guided insertion. Deciding whether a language recognized by a deterministic finite automaton is closed under outfix-guided insertion can be done in polynomial time.