Proceedings 14th International Conference on Automata and Formal Languages

2014/05/21 by Zoltán Ésik, Zoltán Fülöp · 19 citations
Computer Science · #cs.FL

paper · pdf · doi:10.4204/eptcs.151

published as EPTCS 151, 2014

arxiv created 2014/05/21 · arxiv updated 2014/05/22

Abstract

The 14th International Conference Automata and Formal Languages (AFL 2014) was held in Szeged, Hungary, from the 27th to the 29th of May, 2014. The conference was organized by the Department of Foundations of Computer Science of the University of Szeged. Topics of interest covered the theory and applications of automata and formal languages and related areas.

Cited by

• Maximally Atomic Languages
• On the Expressiveness of TPTL and MTL over ω-Data Words
• A Simple Character String Proof of the "True but Unprovable" Version of Gödel's First Incompleteness Theorem
• Synchronizing weighted automata
• Languages of lossless seeds
• Saturation algorithms for model-checking pushdown systems
• From Finite Automata to Regular Expressions and Back--A Summary on Descriptional Complexity
• On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)
• Decision Problems for Deterministic Pushdown Automata on Infinite Words
• Equivalence Problems for Tree Transducers: A Brief Survey
• Grammars with two-sided contexts
• Analyzing Catastrophic Backtracking Behavior in Practical Regular Expression Matching
• Measuring Communication in Parallel Communicating Finite Automata
• Simplifying Nondeterministic Finite Cover Automata
• On Determinism and Unambiguity of Weighted Two-way Automata
• Operations on Automata with All States Final
• Commutative Languages and their Composition by Consensual Methods
• Similarity density of the Thue-Morse word with overlap-free infinite binary words
• Cooperating Distributed Grammar Systems of Finite Index Working in Hybrid Modes
• Representations of Circular Words
• More Structural Characterizations of Some Subregular Language Families by Biautomata
• Buffered Simulation Games for Büchi Automata
• Hyper-Minimization for Deterministic Weighted Tree Automata
• Boolean Circuit Complexity of Regular Languages

Related

• Proceedings 15th International Conference on Automata and Formal Languages
• Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
• Proceedings of the 16th International Workshop on Non-Classical Models of Automata and Applications
• Proceedings Fourth International Symposium on Games, Automata, Logics and Formal Verification
• 10501 Executive Summary – Advances and Applications of Automata on Words and Trees