Semilinearity and Context-Freeness of Languages Accepted by Valence Automata

P. Buckheister, Georg Zetzsche

Type: Book-Chapter

Publication Date: 2013-01-01

Citations: 9

DOI: https://doi.org/10.1007/978-3-642-40313-2_22

View Publication

Download PDF

Locations

Lecture notes in computer science - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Semilinearity and Context-Freeness of Languages Accepted by Valence Automata	2013	P. Buckheister Georg Zetzsche
+	ω-Automata	2016	Thomas Wilke
+ PDF Chat	Precedence Automata and Languages	2011	Violetta Lonati Dino Mandrioli Matteo Pradella
+ PDF Chat	An Introduction to Finite Automata and their Connection to Logic	2012	Howard Straubing Pascal Weil
+ PDF Chat	Language and Automata Theory and Applications	2016	Adrian-Horia Dediu Jan Janoušek Carlos Martı́n-Vide Bianca Truthe
+ PDF Chat	Deterministic Pushdown Automata and Unary Languages	2008	Giovanni Pighizzini
+ PDF Chat	Language recognition power and succinctness of affine automata	2017	Marcos Villagra Abuzer Yakaryılmaz
+	Weak confluence and τ-inertness	2000	Mingsheng Ying
+ PDF Chat	Decidability, Introduction Rules and Automata	2015	Gilles Dowek Ying Jiang
+	Confluence thanks to extensional determinism	2005	Bill Roscoe
+	Rational subsets of polycyclic monoids and valence automata	2007	Elaine Render Mark Kambites
+	{\omega}-Automata	2016	Thomas Wilke
+ PDF Chat	Handbook of Automata Theory	2021	Howard Straubing Pascal Weil
+ PDF Chat	Undecidability and Finite Automata	2017	Jörg Endrullis Jeffrey Shallit Tim Smith
+ PDF Chat	Ordering regular languages and automata: Complexity	2023	Giovanna D’Agostino Davide Martincigh Alberto Policriti
+	On the state complexity of closures and interiors of regular languages with subwords	2014	Prateek Karandikar Matthias Niewerth Philippe Schnoebelen
+	On the state complexity of closures and interiors of regular languages with subwords and superwords	2015	Prateek Karandikar Matthias Niewerth Ph. Schnoebelen
+ PDF Chat	Shortest Repetition-Free Words Accepted by Automata	2013	Hamoon Mousavi Jeffrey Shallit
+ PDF Chat	Languages Given by Finite Automata Over the Unary Alphabet	2024	Wojciech Czerwiński Maciej Dębski Tomasz Gogasz Gordon Hoi Sanjay Jain Michał Skrzypczak Frank Stephan Christopher M. Tan
+ PDF Chat	Silent Transitions in Automata with Storage	2013	Georg Zetzsche

Works That Cite This (5)

Action	Title	Year	Authors
+ PDF Chat	Integer Vector Addition Systems with States	2014	Christoph Haase Simon Halfon
+	Context-free commutative grammars with integer counters and resets	2016	Dmitry Chistikov Christoph Haase Simon Halfon
+	The Complexity of Bidirected Reachability in Valence Systems	2022	Moses Ganardi Rupak Majumdar Georg Zetzsche
+	The rational subset membership problem for groups: a survey	2015	Markus Lohrey
+ PDF Chat	Verifying Unboundedness via Amalgamation	2024	Ashwani Anand Sylvain Schmitz Lia Schütze Georg Zetzsche

Works Cited by This (14)

Action	Title	Year	Authors
+ PDF Chat	Silent Transitions in Automata with Storage	2013	Georg Zetzsche
+	Graph products of groups	1990	Elisabeth Ruth Green
+	Formal Languages and Infinite Groups	1995	Robert H. Gilman
+ PDF Chat	Formal Languages and Groups as Memory	2009	Mark Kambites
+	The submonoid and rational subset membership problems for graph groups	2007	Markus Lohrey Benjamin Steinberg
+ PDF Chat	RATIONAL SUBSETS IN HNN-EXTENSIONS AND AMALGAMATED PRODUCTS	2008	Markus Lohrey Géraud Sénizergues
+	The Burnside problem and related topics	2011	Сергей Иванович Адян
+	The theory of well-quasi-ordering: A frequently discovered concept	1972	Joseph B. Kruskal
+ PDF Chat	On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids	2011	Georg Zetzsche
+ PDF Chat	When Is a Graph Product of Groups Virtually-Free?	2007	Markus Lohrey Géraud Sénizergues