Special issue: Selected papers of the 9th international conference on language and automata theory and applications, LATA 2015 (Q2424669): Difference between revisions

Revision as of 16:06, 19 July 2024

scientific article

Language	Label	Description	Also known as
English	Special issue: Selected papers of the 9th international conference on language and automata theory and applications, LATA 2015	scientific article

Statements

instance of

scholarly article

0 references

title

Special issue: Selected papers of the 9th international conference on language and automata theory and applications, LATA 2015 (English)

0 references

published in

Journal of Computer and System Sciences

0 references

publication date

25 June 2019

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1016/j.jcss.2019.05.002

0 references

cites work

Complexity of regular functions

0 references

Automated synthesis of application-layer connectors from automata-based specifications

0 references

A Nivat theorem for weighted picture automata and weighted MSO logics

0 references

Recognizable series on graphs and hypergraphs

0 references

A game characterisation of tree-like Q-resolution size

0 references

Recurrence relations, succession rules and the positivity problem

0 references

Efficient enumeration of weighted tree languages over the tropical semiring

0 references

Towards more precise rewriting approximations

0 references

Logics for unordered trees with data constraints

0 references

Linking indexing data structures to de Bruijn graphs: construction and update

0 references

Sorting networks: to the end and back again

0 references

Bounding clique-width via perfect graphs

0 references

Two parallel algorithms for finding all minimal maximum subsequences

0 references

Insertion operations on deterministic reversal-bounded counter machines

0 references

Coverability and multi-scale coverability on infinite pictures

0 references

One-variable context-free hedge automata

0 references

Classifying invariant structures of step traces

0 references

Derivatives and partial derivatives for regular shuffle expressions

0 references

Complexity of road coloring with prescribed reset words

0 references

Distributional learning of conjunctive grammars and contextual binary feature grammars

0 references

Identifiers

zbMATH Open document ID

1423.68020

0 references

DOI

10.1016/j.jcss.2019.05.002

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2424669

@@ Property / cites work @@
+Complexity of regular functions
@@ Property / cites work: Complexity of regular functions / rank @@
+Normal rank
@@ Property / cites work @@
+Automated synthesis of application-layer connectors from automata-based specifications
+Normal rank
@@ Property / cites work @@
+A Nivat theorem for weighted picture automata and weighted MSO logics
+Normal rank
@@ Property / cites work @@
+Recognizable series on graphs and hypergraphs
@@ Property / cites work: Recognizable series on graphs and hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A game characterisation of tree-like Q-resolution size
+Normal rank
@@ Property / cites work @@
+Recurrence relations, succession rules and the positivity problem
+Normal rank
@@ Property / cites work @@
+Efficient enumeration of weighted tree languages over the tropical semiring
+Normal rank
@@ Property / cites work @@
+Towards more precise rewriting approximations
@@ Property / cites work: Towards more precise rewriting approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Logics for unordered trees with data constraints
@@ Property / cites work: Logics for unordered trees with data constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Linking indexing data structures to de Bruijn graphs: construction and update
+Normal rank
@@ Property / cites work @@
+Sorting networks: to the end and back again
@@ Property / cites work: Sorting networks: to the end and back again / rank @@
+Normal rank
@@ Property / cites work @@
+Bounding clique-width via perfect graphs
@@ Property / cites work: Bounding clique-width via perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Two parallel algorithms for finding all minimal maximum subsequences
+Normal rank
@@ Property / cites work @@
+Insertion operations on deterministic reversal-bounded counter machines
+Normal rank
@@ Property / cites work @@
+Coverability and multi-scale coverability on infinite pictures
+Normal rank
@@ Property / cites work @@
+One-variable context-free hedge automata
@@ Property / cites work: One-variable context-free hedge automata / rank @@
+Normal rank
@@ Property / cites work @@
+Classifying invariant structures of step traces
@@ Property / cites work: Classifying invariant structures of step traces / rank @@
+Normal rank
@@ Property / cites work @@
+Derivatives and partial derivatives for regular shuffle expressions
+Normal rank
@@ Property / cites work @@
+Complexity of road coloring with prescribed reset words
+Normal rank
@@ Property / cites work @@
+Distributional learning of conjunctive grammars and contextual binary feature grammars
+Normal rank